Tree Contractions and Evolutionary Trees
- 1 December 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (6) , 1592-1616
- https://doi.org/10.1137/s0097539795283504
Abstract
No abstract availableAll Related Versions
This publication has 35 references indexed in Scilit:
- A robust model for finding optimal evolutionary treesAlgorithmica, 1995
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is FixedSIAM Journal on Computing, 1994
- Convex tree realizations of partitionsApplied Mathematics Letters, 1992
- A simple parallel tree contraction algorithmJournal of Algorithms, 1989
- PHYLOGENIES FROM MOLECULAR SEQUENCES: INFERENCE AND RELIABILITYAnnual Review of Genetics, 1988
- The longest common subsequence problem revisitedAlgorithmica, 1987
- Computational complexity of inferring phylogenies from chromosome inversion dataJournal of Theoretical Biology, 1987
- Numerical Methods for Inferring Evolutionary TreesThe Quarterly Review of Biology, 1982
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational ExpressionsSIAM Journal on Computing, 1981
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976