The maximum weight trace problem in multiple sequence alignment
- 17 June 2005
- book chapter
- Published by Springer Nature
- p. 106-119
- https://doi.org/10.1007/bfb0029800
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Efficient methods for multiple sequence alignment with guaranteed error boundsBulletin of Mathematical Biology, 1993
- Two algorithms for the longest common subsequence of three (or more) stringsPublished by Springer Nature ,1992
- Trees, Stars, and Multiple Biological Sequence AlignmentSIAM Journal on Applied Mathematics, 1989
- The Multiple Sequence Alignment Problem in BiologySIAM Journal on Applied Mathematics, 1988
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Progressive sequence alignment as a prerequisitetto correct phylogenetic treesJournal of Molecular Evolution, 1987
- Self-adjusting binary search treesJournal of the ACM, 1985
- Computing a longest common subsequence for a set of stringsBIT Numerical Mathematics, 1984
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Minimal Mutation Trees of SequencesSIAM Journal on Applied Mathematics, 1975