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

DOI10.1007/S11538-010-9579-3MaRDI QIDQ545651zbMATH OpenOpenAlexWikidataFDO

Authors Juanjuan Chai, Elizabeth Ann Housworth

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

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

Recommendations

• Tree reconstruction from multi-state characters
• Non-hereditary maximum parsimony trees
• Four Characters Suffice to Convexly Define a Phylogenetic Tree
• Ancestral sequence reconstruction with maximum parsimony
• Maximum parsimony on subsets of taxa

Cites work

• scientific article; zbMATH DE number 2044913 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• Four Characters Suffice to Convexly Define a Phylogenetic Tree
• Proving phylogenetic trees minimal with l-clustering and set partitioning

Cited in

(9)

• Parsimony and the rank of a flattening matrix
• A distance measure based on binary character data and its application to phylogeny reconstruction
• Five surprising properties of parsimoniously colored trees
• Tree reconstruction from multi-state characters
• The size of the character state space affects the occurrence and detection of homoplasy: modelling the probability of incompatibility for unordered phylogenetic characters
• Sufficient condition for root reconstruction by parsimony on binary trees with general weights
• Defining binary phylogenetic trees using parsimony
• Defining binary phylogenetic trees using parsimony: new bounds
• Hypothesis testing in perfect phylogeny for a bounded number of characters

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545651)