Lattice-theoretic properties of MPR-posets in phylogeny

DOI10.1016/S0166-218X(03)00303-2zbMath1032.92026OpenAlexW2055259624MaRDI QIDQ1421468

Hiroshi Narushima, Kampei Miyakawa

Publication date: 26 January 2004

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00303-2

zbMATH Keywords

Evolutionary treeCharacter-state optimizationLattice-theoretic propertiesMaximum parsimonyMPR-poset

Mathematics Subject Classification ID

Problems related to evolution (92D15) Taxonomy, cladistics, statistics in mathematical biology (92B10) Combinatorics in computer science (68R05) Complete distributivity (06D10)

Uses Software

• PAUP*

Cites Work

• Reconstructing ancestral character states under Wagner parsimony
• A more efficient algorithm for MPR problems in phylogeny
• Time bounds for selection
• On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization
• Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lattice-theoretic properties of MPR-posets in phylogeny