On the complexity of comparing evolutionary trees
- 1 December 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 71 (1-3) , 153-169
- https://doi.org/10.1016/s0166-218x(96)00062-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the Approximation of Shortest Common Supersequences and Longest Common SubsequencesSIAM Journal on Computing, 1995
- Alignment of trees — an alternative to tree editTheoretical Computer Science, 1995
- Tree Compatibility and Inferring Evolutionary HistoryJournal of Algorithms, 1994
- Kaikoura tree theorems: Computing the maximum agreement subtreeInformation Processing Letters, 1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Maximum bounded 3-dimensional matching is MAX SNP-completeInformation Processing Letters, 1991
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- Reconstructing evolution of sequences subject to recombination using parsimonyMathematical Biosciences, 1990
- Obtaining common pruned treesJournal of Classification, 1985
- A mathematical foundation for the analysis of cladistic character compatibilityMathematical Biosciences, 1976