Inferring Evolutionary History From DNA Sequences
- 1 August 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (4) , 713-737
- https://doi.org/10.1137/s0097539791222171
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- A Simple Linear Time Algorithm for Triangulating Three-Colored GraphsJournal of Algorithms, 1993
- Convex tree realizations of partitionsApplied Mathematics Letters, 1992
- Two strikes against perfect phylogenyPublished by Springer Nature ,1992
- The computational complexity of inferring rooted phylogenies by parsimonyMathematical Biosciences, 1986
- Computational Complexity of Inferring Phylogenies by CompatibilitySystematic Zoology, 1986
- Computationally difficult parsimony problems in phylogenetic systematicsJournal of Theoretical Biology, 1983
- An idealized concept of the true cladistic characterMathematical Biosciences, 1975
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- Cladistic Methodology: A Discussion of the Theoretical Basis for the Induction of Evolutionary HistoryAnnual Review of Ecology and Systematics, 1972
- A Method for Deducing Branching Sequences in PhylogenyEvolution, 1965