A space efficient algorithm for finding the best non-overlapping alignment score
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An algorithm for approximate tandem repeatsPublished by Springer Nature ,2005
- An algorithm for locating non-overlapping regions of maximum alignment scorePublished by Springer Nature ,2005
- 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
- The String-to-String Correction ProblemJournal of the ACM, 1974