A basic analysis toolkit for biological sequences
Open Access
- 18 September 2007
- journal article
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 2 (1) , 10
- https://doi.org/10.1186/1748-7188-2-10
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- An improved algorithm for matching biological sequencesPublished by Elsevier ,2004
- Faster algorithms for string matching with k mismatchesJournal of Algorithms, 2003
- Sparse Dynamic Programming for Longest Common Subsequence from FragmentsJournal of Algorithms, 2002
- On-line construction of suffix treesAlgorithmica, 1995
- Sparse dynamic programming IIJournal of the ACM, 1992
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Speeding up dynamic programming with applications to molecular biologyTheoretical Computer Science, 1989
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- Efficient sequence alignment algorithmsJournal of Theoretical Biology, 1984
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977