A combinatorial description of the closest tree algorithm for finding evolutionary trees

DOI10.1016/0012-365X(91)90469-IzbMath0746.05059MaRDI QIDQ1182982

Michael D. Hendy

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

evolutionary treesmaximum parsimonyphylogenetic tree reconstruction

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Statistics for phylogenetic trees, Maximum likelihood estimation of symmetric group-based models via numerical algebraic geometry, Spectral analysis and a closest tree method for genetic sequences, Spectral analysis of phylogenetic data, Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results, Phylogenetic analysis of nucleotide sequences: An algebraic approach

Cites Work

• Branch and bound algorithms to determine minimal evolutionary trees
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• Taxonomy with confidence