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

DOI10.1007/S11538-010-9579-3zbMATH Open1215.92045OpenAlexW2088272905WikidataQ44359297 ScholiaQ44359297MaRDI QIDQ545651FDOQ545651

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

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

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)

Cites Work

• A Separator Theorem for Planar Graphs
• Proving phylogenetic trees minimal with l-clustering and set partitioning
• Title not available (Why is that?)
• Four Characters Suffice to Convexly Define a Phylogenetic Tree

Cited In (6)

• Tree reconstruction from multi-state characters
• A distance measure based on binary character data and its application to phylogeny reconstruction
• Five surprising properties of parsimoniously colored trees
• Sufficient condition for root reconstruction by parsimony on binary trees with general weights
• Parsimony and the rank of a flattening matrix
• 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)