A combinatorial description of the closest tree algorithm for finding evolutionary trees
- 4 December 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 96 (1), 51-58
- https://doi.org/10.1016/0012-365x(91)90469-i
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Framework for the Quantitative Study of Evolutionary TreesSystematic Zoology, 1989
- The Relationship Between Simple Evolutionary Tree Models and Observable Sequence DataSystematic Zoology, 1989
- PHYLOGENIES FROM MOLECULAR SEQUENCES: INFERENCE AND RELIABILITYAnnual Review of Genetics, 1988
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational timeMathematical Biosciences, 1982
- Branch and bound algorithms to determine minimal evolutionary treesMathematical Biosciences, 1982
- Cases in which Parsimony or Compatibility Methods Will be Positively MisleadingSystematic Zoology, 1978
- Taxonomy with confidenceMathematical Biosciences, 1978
- Toward Defining the Course of Evolution: Minimum Change for a Specific Tree TopologySystematic Zoology, 1971