On the number of binary characters needed to recover a phylogeny using maximum parsimony

DOI10.1007/s11538-010-9579-3zbMath1215.92045OpenAlexW2088272905WikidataQ44359297 ScholiaQ44359297MaRDI QIDQ545651

Elizabeth Ann Housworth, Juanjuan Chai

Publication date: 22 June 2011

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11538-010-9579-3

zbMATH Keywords

homoplasyone-clustering

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Complexity and performance of numerical algorithms (65Y20) Computer aspects of numerical algorithms (65Y99)

Related Items (1)

Sufficient condition for root reconstruction by parsimony on binary trees with general weights

Cites Work

• Proving phylogenetic trees minimal with l-clustering and set partitioning
• A Separator Theorem for Planar Graphs
• Four Characters Suffice to Convexly Define a Phylogenetic Tree
• Unnamed Item

This page was built for publication: On the number of binary characters needed to recover a phylogeny using maximum parsimony