Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- 1 September 1986
- journal article
- research article
- Published by Springer Nature in Journal of Classification
- Vol. 3 (2), 335-348
- https://doi.org/10.1007/bf01894195
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimal algorithms for comparing trees with labeled leavesJournal of Classification, 1985
- Obtaining common pruned treesJournal of Classification, 1985
- Counting dendrograms: A surveyDiscrete Applied Mathematics, 1984
- Faithful consensus methods for n-treesMathematical Biosciences, 1983
- Philosophy and Method in Biological ClassificationPublished by Springer Nature ,1983
- A View of Some Consensus Methods for TreesPublished by Springer Nature ,1983
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- The numbers of classificationsCanadian Journal of Botany, 1976
- Consensus Techniques and the Comparison of Taxonomic TreesSystematic Zoology, 1972
- The probabilities of rooted tree-shapes generated by random bifurcationAdvances in Applied Probability, 1971