Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

The Distance Formula01:20

The Distance Formula

804
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
804
Phylogenetic Trees03:21

Phylogenetic Trees

41.6K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
41.6K
Phylogenetic Trees03:21

Phylogenetic Trees

5.7K
5.7K
Distance Problem01:29

Distance Problem

216
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
216
Survival Tree01:19

Survival Tree

498
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
498
Scalar and Vector Triple Products01:06

Scalar and Vector Triple Products

4.2K
Two vectors can be multiplied using a scalar product or a vector product. The resultant of a scalar product is scalar, while with vector products, the resultant is a vector. These rules of the scalar or vector product between two vectors can be applied to multiple vectors to obtain meaningful combinations. The scalar triple product is the dot product of a vector with the cross product of two vectors.
The scalar triple product is the dot product of a vector with the cross product of two vectors....
4.2K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Finding Pathways in Reaction Networks Guided by Energy Barriers Using Integer Linear Programing.

Molecular informatics·2026
Same author

A Sensitivity Analysis Methodology for Rule-Based Stochastic Chemical Systems.

Journal of chemical information and modeling·2026
Same author

Computational approaches in chemical space exploration for carbon fixation pathways.

NPJ systems biology and applications·2026
Same author

SynKit: A Graph-Based Python Framework for Rule-Based Reaction Modeling and Analysis.

Journal of chemical information and modeling·2025
Same author

KGG: Knowledge-Guided Graph Self-Supervised Learning to Enhance Molecular Property Predictions.

Journal of chemical information and modeling·2025
Same author

Finding Thermodynamically Favorable Pathways in Chemical Reaction Networks Using Flows in Hypergraphs and Mixed-Integer Linear Programming.

Journal of chemical information and modeling·2025

Related Experiment Video

Updated: Apr 29, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

35.2K

Algorithms for computing the triplet and quartet distances for binary and general trees.

Andreas Sand1, Morten K Holt2, Jens Johansen3

  • 1Department of Computer Science, Aarhus University, IT-Parken, Aabogade 34, DK-8200 Aarhus N, Denmark. asand@birc.au.dk.

Biology
|May 17, 2014
PubMed
Summary
This summary is machine-generated.

This study reviews efficient algorithms for computing tree distances, specifically triplet and quartet distances. Algorithmic improvements reduce computational complexity for comparing phylogenetic trees.

More Related Videos

BEST: Barcode Enabled Sequencing of Tetrads
12:59

BEST: Barcode Enabled Sequencing of Tetrads

Published on: May 1, 2014

13.0K
Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations
11:15

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

4.6K

Related Experiment Videos

Last Updated: Apr 29, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

35.2K
BEST: Barcode Enabled Sequencing of Tetrads
12:59

BEST: Barcode Enabled Sequencing of Tetrads

Published on: May 1, 2014

13.0K
Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations
11:15

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

4.6K

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Algorithm Analysis

Background:

  • Comparing phylogenetic trees is crucial in evolutionary biology.
  • Existing methods for calculating triplet and quartet distances have high computational complexity (n³ or n⁴).
  • Efficient algorithms are needed to handle large datasets in phylogenetics.

Purpose of the Study:

  • To review and present algorithmic improvements for computing tree distances.
  • To detail strategies for efficient calculation of triplet and quartet distances.
  • To highlight advancements in phylogenetic tree comparison methodologies.

Main Methods:

  • Review of algorithmic improvements over the last decade.
  • Exploration of dynamic programming strategies for distance calculation.
  • Analysis of leaf coloring and hierarchical decomposition techniques.
  • Implicit counting of differing topologies to avoid explicit enumeration.

Main Results:

  • Development of algorithms with improved time complexity for tree distance computation.
  • Demonstration of efficiency gains through dynamic programming and leaf coloring methods.
  • Establishment of faster methods for comparing rooted (triplet) and unrooted (quartet) trees.

Conclusions:

  • Significant advancements have been made in efficiently computing tree distances.
  • Dynamic programming and leaf coloring offer viable strategies for faster phylogenetic analysis.
  • These improved algorithms are essential for systematic and scalable tree comparison in bioinformatics.