A space efficient algorithm for finding the best nonoverlapping alignment score
- 1 July 1995
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 145 (1-2) , 357-369
- https://doi.org/10.1016/0304-3975(95)92848-r
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