Parametric maximum parsimonious reconstruction on trees
From MaRDI portal
Publication:644569
DOI10.1007/S11538-010-9574-8zbMATH Open1228.92057OpenAlexW2038953696WikidataQ51667083 ScholiaQ51667083MaRDI QIDQ644569FDOQ644569
Publication date: 4 November 2011
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.542.2797
Recommendations
- Sufficient condition for root reconstruction by parsimony on binary trees with general weights
- Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
- Quantifying the accuracy of ancestral state prediction in a phylogenetic tree under maximum parsimony
- Optimal phylogenetic reconstruction
- Combinatorial Pattern Matching
Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05) Dynamic programming (90C39)
Cites Work
Cited In (4)
- Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
- Algebraic properties of the most parsimonious reconstructions of the hypothetical ancestors on a given tree
- Time-dependent-asymmetric-linear-parsimonious ancestral state reconstruction
- Counting ancestral reconstructions in a fixed phylogeny
Uses Software
This page was built for publication: Parametric maximum parsimonious reconstruction on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644569)