An algorithm for locating non-overlapping regions of maximum alignment score
- 17 June 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- Efficient Parallel Algorithms for String Editing and Related ProblemsSIAM Journal on Computing, 1990
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- The String-to-String Correction ProblemJournal of the ACM, 1974