Proving phylogenetic trees minimal with l-clustering and set partitioning
- 1 September 1980
- journal article
- research article
- Published by Elsevier in Mathematical Biosciences
- Vol. 51 (1-2) , 71-88
- https://doi.org/10.1016/0025-5564(80)90091-7
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A general approach to proving the minimality of phylogenetic trees illustrated by an example with a set of 23 vertebratesJournal of Molecular Evolution, 1979
- 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
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956