Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method

DOI10.1016/0166-218X(94)00089-VzbMath0822.05023MaRDI QIDQ1842656

Hiroshi Narushima, Masazumi Hanazawa, Nobuhiro Minaka

Publication date: 5 October 1995

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

zbMATH Keywords

treecomputational complexityreconstructionevaluated leaf treeFarris-Swofford-Maddison methodmedian interval

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Taxonomy, cladistics, statistics in mathematical biology (92B10)

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

Cites Work

• Reconstructing ancestral character states under Wagner parsimony
• Time bounds for selection

This page was built for publication: Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method