A supertree method for rooted trees
Top Cited Papers
- 15 October 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 105 (1-3) , 147-158
- https://doi.org/10.1016/s0166-218x(00)00202-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Phylogenetic supertrees: Assembling the trees of lifePublished by Elsevier ,1998
- Reconstruction of rooted trees from subtreesDiscrete Applied Mathematics, 1996
- A composite estimate of primate phylogenyPhilosophical Transactions Of The Royal Society B-Biological Sciences, 1995
- An efficient algorithm for supertreesJournal of Classification, 1995
- The complexity of reconstructing trees from qualitative characters and subtreesJournal of Classification, 1992
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leavesJournal of Classification, 1986
- N-trees as nestings: Complexity, similarity, and consensusJournal of Classification, 1986
- A View of Some Consensus Methods for TreesPublished by Springer Nature ,1983
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational ExpressionsSIAM Journal on Computing, 1981
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961