Computationally difficult parsimony problems in phylogenetic systematics
- 1 August 1983
- journal article
- research article
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 103 (3), 429-438
- https://doi.org/10.1016/0022-5193(83)90296-5
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational timeMathematical Biosciences, 1982
- A graph theoretic approach to the development of minimal phylogenetic treesJournal of Molecular Evolution, 1979
- Identification of phylogenetic trees of minimal lengthJournal of Theoretical Biology, 1978
- On the Problem of Discovering the Most Parsimonious TreeThe American Naturalist, 1977
- Estimating Phylogenetic Trees from Distance MatricesThe American Naturalist, 1972
- Methods for Computing Wagner TreesSystematic Zoology, 1970
- A general solution in partial orders for the Camin-Sokal model in phylogenyJournal of Theoretical Biology, 1968
- The Meaning of Relationship and Taxonomic ProcedureSystematic Zoology, 1967
- Construction of Phylogenetic TreesScience, 1967
- A Method for Deducing Branching Sequences in PhylogenyEvolution, 1965