Sparse Dynamic Programming for Evolutionary-Tree Comparison
- 1 February 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 26 (1) , 210-230
- https://doi.org/10.1137/s0097539794262422
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A robust model for finding optimal evolutionary treesAlgorithmica, 1995
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- PHYLOGENIES FROM MOLECULAR SEQUENCES: INFERENCE AND RELIABILITYAnnual Review of Genetics, 1988
- MOLECULAR VERSUS MORPHOLOGICAL APPROACHES TO SYSTEMATICSAnnual Review of Ecology and Systematics, 1987
- O(n2.5) time algorithms for the subgraph homeomorphism problem on treesJournal of Algorithms, 1987
- Foreword: Comparison and consensus of classificationsJournal of Classification, 1986
- Obtaining common pruned treesJournal of Classification, 1985
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Estimating Phylogenetic Trees from Distance MatricesThe American Naturalist, 1972