A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
- 1 January 2002
- journal article
- Published by Elsevier in Applied Mathematics Letters
- Vol. 15 (1) , 11-16
- https://doi.org/10.1016/s0893-9659(01)00085-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A space-efficient algorithm for aligning large genomic sequencesBioinformatics, 2000
- A polyhedral approach to sequence alignment problemsDiscrete Applied Mathematics, 2000
- An exact solution for the segment-to-segment multiple sequence alignment problem.Bioinformatics, 1999
- DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment.Bioinformatics, 1999
- Multiple DNA and protein sequence alignment based on segment-to-segment comparison.Proceedings of the National Academy of Sciences, 1996
- Linear-space algorithms that build local alignments from fragmentsAlgorithmica, 1995
- Sparse dynamic programming IJournal of the ACM, 1992
- Rapid similarity searches of nucleic acid and protein data banks.Proceedings of the National Academy of Sciences, 1983
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970