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

Survival Tree01:19

Survival Tree

464
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...
464
Rationalizing Substitutions01:29

Rationalizing Substitutions

84
Integrals involving non-rational functions are often difficult to evaluate using standard techniques, especially when radicals appear in the integrand. Rationalizing substitution provides a systematic method for simplifying such integrals by converting them into rational forms that are easier to handle.Consider a rod whose linear mass density depends on a constant linear density, a characteristic length, and the distance from the left end of the rod. Determining the total mass requires...
84
Adjusting a Traverse01:12

Adjusting a Traverse

422
In the site survey of a four-sided traverse, internal angles are essential to ensure geometric accuracy. The survey revealed that the sum of the measured internal angles was 359 degrees and 48 minutes, which is 12 minutes less than the expected 360 degrees. This discrepancy signals an error likely arising from measurement inaccuracies during the fieldwork.To rectify this error, the adjustment process involved distributing the 12-minute shortfall equally across the four internal angles. By...
422
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

818
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
818
Phylogenetic Trees03:21

Phylogenetic Trees

51.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.
51.6K
Phylogenetic Trees03:21

Phylogenetic Trees

6.8K
6.8K

You might also read

Related Articles

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

Sort by
Same author

Shape-constrained, changepoint additive models for time series omics data with cpam.

Nucleic acids research·2026
Same author

Leveraging advances in machine learning for the robust classification and interpretation of networks.

Royal Society open science·2025
Same author

Dehydration rapidly induces expression of NCED genes from a single subclade in diverse eudicots.

Planta·2025
Same author

Spectral cluster supertree: fast and statistically robust merging of rooted phylogenetic trees.

Frontiers in molecular biosciences·2024
Same author

David Penny-An indomitable evolutionary biologist.

Proceedings of the National Academy of Sciences of the United States of America·2024
Same author

Ancient and Modern Genomes Reveal Microsatellites Maintain a Dynamic Equilibrium Through Deep Time.

Genome biology and evolution·2024
Same journal

A k-mer-based estimator of the substitution rate between repetitive sequences.

Algorithms for molecular biology : AMB·2026
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Mar 20, 2026

Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
06:56

Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

Published on: September 22, 2023

1.8K

Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem.

Benjamin Drinkwater1, Michael A Charleston2

  • 1School of Information Technologies, University of Sydney, 1 Cleveland St, Sydney, 2006 NSW Australia.

Algorithms for Molecular Biology : AMB
|May 24, 2016
PubMed
Summary
This summary is machine-generated.

This study introduces a novel dynamic programming formulation for tree reconciliation, significantly reducing space complexity and running time. The new algorithm achieves optimal solutions faster than existing methods, advancing coevolutionary analysis.

Keywords:
CoevolutionCophylogenyNP-hardPhylognyTree reconciliationTree shape

More Related Videos

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring
08:16

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring

Published on: October 24, 2025

816
A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges
09:33

A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges

Published on: March 5, 2015

29.8K

Related Experiment Videos

Last Updated: Mar 20, 2026

Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
06:56

Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

Published on: September 22, 2023

1.8K
Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring
08:16

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring

Published on: October 24, 2025

816
A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges
09:33

A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges

Published on: March 5, 2015

29.8K

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Coevolutionary analysis leverages tree topology to manage complexity in inferring interrelationships between phylogenetic trees.
  • Prior work achieved logarithmic space complexity reduction for dated tree reconciliation.

Purpose of the Study:

  • To develop a new formulation for dynamic programming tables in coevolutionary analysis.
  • To achieve further asymptotic space reduction and sub-quadratic running time for the dated tree reconciliation problem.

Main Methods:

  • Introduced a novel dynamic programming table formulation for coevolutionary analysis.
  • Analyzed tree topology and underlying dynamic programming algorithm structures.
  • Developed a sub-quadratic time algorithm for dated tree reconciliation.

Main Results:

  • Achieved significant asymptotic space reduction and sub-quadratic running time.
  • Demonstrated practical speed improvements, outperforming existing algorithms for expected evolutionary trees.
  • Validated theoretical complexity bounds with synthetic and biological data.

Conclusions:

  • The new model offers substantial space savings and runs in half the time of the fastest known algorithms.
  • Guarantees optimality of inferred solutions, a significant advancement over comparable speed algorithms.