Algorithmic Aspects of Tree Amalgamation
- 30 November 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 37 (2) , 522-537
- https://doi.org/10.1006/jagm.2000.1116
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Orchestrating quartets: approximation and data correctionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Inferring evolutionary trees with strong combinatorial evidenceTheoretical Computer Science, 2000
- Patching upX-treesAnnals of Combinatorics, 1999
- A few logs suffice to build (almost) all trees (I)Random Structures & Algorithms, 1999
- Phylogenetic supertrees: Assembling the trees of lifePublished by Elsevier ,1998
- Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal RelationshipsJournal of Computational Biology, 1998
- Extension Operations on Sets of Leaf-Labeled TreesAdvances in Applied Mathematics, 1995
- The complexity of reconstructing trees from qualitative characters and subtreesJournal of Classification, 1992
- Reconstructing the shape of a tree from observed dissimilarity dataAdvances in Applied Mathematics, 1986
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational ExpressionsSIAM Journal on Computing, 1981