A more efficient algorithm for MPR problems in phylogeny

DOI10.1016/S0166-218X(97)00088-7zbMath0894.68071OpenAlexW2058923178MaRDI QIDQ1382281

Hiroshi Narushima, Masazumi Hanazawa

Publication date: 25 March 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

principle of maximum parsimony

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization ⋮ A more efficient algorithm for MPR problems in phylogeny ⋮ Lattice-theoretic properties of MPR-posets in phylogeny

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

This page was built for publication: A more efficient algorithm for MPR problems in phylogeny