On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization

DOI10.1016/S0166-218X(01)00360-2zbMath1175.90338OpenAlexW2089466038MaRDI QIDQ1613424

Natalia Misheva, Hiroshi Narushima

Publication date: 29 August 2002

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

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

zbMATH Keywords

Evolutionary treeMaximum parsimonyMPR-posetAccelerated transformation optimizationMost-parsimonious reconstraction

Mathematics Subject Classification ID

Problems related to evolution (92D15) Combinatorial optimization (90C27)

Related Items (3)

A more efficient algorithm for MPR problems in phylogeny ⋮ Lattice-theoretic properties of MPR-posets in phylogeny ⋮ How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree

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
• Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
• Extending a function on a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization