The computational complexity of inferring rooted phylogenies by parsimony
- 1 September 1986
- journal article
- research article
- Published by Elsevier in Mathematical Biosciences
- Vol. 81 (1) , 33-42
- https://doi.org/10.1016/0025-5564(86)90161-6
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Computational Complexity of Inferring Phylogenies by CompatibilitySystematic Zoology, 1986
- Parsimony in Systematics: Biological and Statistical IssuesAnnual Review of Ecology and Systematics, 1983
- Computationally difficult parsimony problems in phylogenetic systematicsJournal of Theoretical Biology, 1983
- Numerical Methods for Inferring Evolutionary TreesThe Quarterly Review of Biology, 1982
- Alternative Methods of Phylogenetic Inference and Their InterrelationshipSystematic Zoology, 1979
- Inferring Phylogenetic Trees from Chromosome Inversion DataSystematic Zoology, 1978
- Some Further Comments on Le Quesne's MethodsSystematic Zoology, 1977
- Phylogenetic Analysis Under Dollo's LawSystematic Zoology, 1977
- Methods for Computing Wagner TreesSystematic Zoology, 1970
- A Method for Deducing Branching Sequences in PhylogenyEvolution, 1965