Reconstructing ancestral character states under Wagner parsimony

DOI10.1016/0025-5564(87)90074-5zbMath0673.92007OpenAlexW1972189965WikidataQ29035914 ScholiaQ29035914MaRDI QIDQ1121196

Wayne P. Maddison, David L. Swofford

Publication date: 1987

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(87)90074-5

zbMATH Keywords

algorithmsPhylogenetic treesminimum-length treesmostMPRparsimonious reconstructionPAUP programprinciple of maximum parsimonytaxonomic unitsWagner parsimony criterion

Mathematics Subject Classification ID

Trees (05C05) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (8)

On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization ⋮ A comparison of ancestral state reconstruction methods for quantitative characters ⋮ A more efficient algorithm for MPR problems in phylogeny ⋮ Time-dependent-asymmetric-linear-parsimonious ancestral state reconstruction ⋮ Using the Ornstein-Uhlenbeck process to model the evolution of interacting populations ⋮ Lattice-theoretic properties of MPR-posets in phylogeny ⋮ How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree ⋮ Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method

Uses Software

• PAUP*

Cites Work

• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• Parallel concepts in graph theory

This page was built for publication: Reconstructing ancestral character states under Wagner parsimony