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 Experiment Videos

Performance of flip supertree construction with a heuristic algorithm.

Oliver Eulenstein1, Duhong Chen, J Gordon Burleigh

  • 1Department of Computer Science, Iowa State University, Ames, Iowa 50011, USA. oeulenst@cs.iastate.edu

Systematic Biology
|June 19, 2004
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

A PLUM Job: Peptide modeLs for Understanding and engineering antiMicrobial therapeutics.

bioRxiv : the preprint server for biology·2026
Same author

Phylo-rs: an extensible phylogenetic analysis library in rust.

BMC bioinformatics·2025
Same author

Computing generalized cophenetic distances under all Lp norms: A near-linear time algorithmic framework.

PLoS computational biology·2025
Same author

Ancient reticulation, incomplete lineage sorting and the evolution of the pyrenoid at the dawn of hornwort diversification.

Annals of botany·2025
Same author

Fundamental Patterns of Structural Evolution Revealed by Chromosome-Length Genomes of Cactophilic Drosophila.

Genome biology and evolution·2024
Same author

All tangled up: Unraveling phylogenetics and reticulate evolution in the vining ferns, Lygodium (Schizaeales).

American journal of botany·2024

A new heuristic algorithm for the flip supertree problem improves phylogenetic tree construction. This method accurately resolves incompatibilities in large datasets, offering a viable alternative for supertree methods.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Supertree methods assemble multiple phylogenetic trees into a single comprehensive hypothesis.
  • Existing supertree construction methods are limited, especially for large datasets.
  • The flip supertree problem addresses incompatibilities between input trees via matrix representation changes.

Purpose of the Study:

  • To develop a heuristic algorithm for the flip supertree problem scalable to large numbers of taxa.
  • To evaluate the accuracy and performance of the new heuristic algorithm against existing methods.

Main Methods:

  • Development of a heuristic algorithm for the flip supertree problem.
  • Simulation studies using 48- and 96-taxon datasets.
  • Comparison of supertrees generated by the heuristic flip method with MinCut (MC), modified MC (MMC), and matrix representation with parsimony (MRP).

Related Experiment Videos

Main Results:

  • The heuristic flip supertree algorithm is suitable for large input trees.
  • Flip supertrees demonstrated significantly higher accuracy than MC and MMC algorithms.
  • The accuracy of flip supertrees was comparable to MRP methods.

Conclusions:

  • The heuristic flip supertree algorithm is a computationally efficient and accurate method for constructing supertrees.
  • This method provides a viable and accurate alternative for supertree construction, particularly with large datasets.