A polynomial-time algorithm for near-perfect phylogeny
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Fast Algorithms for Inferring Evolutionary TreesJournal of Computational Biology, 1995
- Convex tree realizations of partitionsApplied Mathematics Letters, 1992
- Triangulating 3-Colored GraphsSIAM Journal on Discrete Mathematics, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989
- The computational complexity of inferring rooted phylogenies by parsimonyMathematical Biosciences, 1986
- An idealized concept of the true cladistic characterMathematical Biosciences, 1975
- ASPECTS OF MOLECULAR EVOLUTIONAnnual Review of Genetics, 1973
- Cladistic Methodology: A Discussion of the Theoretical Basis for the Induction of Evolutionary HistoryAnnual Review of Ecology and Systematics, 1972