[39] Unified approach to alignment and phylogenies
Author:
- Jotun HeinJHJotun Hein
- 1 January 1990
- book chapter
- Published by Elsevier
- Vol. 183, 626-645
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimumMathematical Biosciences, 1985
- Confidence Limits on Phylogenies: An Approach Using the BootstrapEvolution, 1985
- Algorithms for approximate string matchingInformation and Control, 1985
- An improved algorithm for matching biological sequencesJournal of Molecular Biology, 1982
- The steiner problem in phylogeny is NP-completeAdvances in Applied Mathematics, 1982
- Cases in which Parsimony or Compatibility Methods Will be Positively MisleadingSystematic Zoology, 1978
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- Minimal Mutation Trees of SequencesSIAM Journal on Applied Mathematics, 1975
- An algorithm for the distance between two finite sequencesJournal of Combinatorial Theory, Series A, 1974
- Comparison of labeled trees with valency threeJournal of Combinatorial Theory, Series B, 1971