An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
- 1 June 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 25 (3) , 648-662
- https://doi.org/10.1137/s0097539794262677
Abstract
No abstract availableThis publication has 9 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
- A space efficient algorithm for finding the best non-overlapping alignment scorePublished by Springer Nature ,1994
- 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
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974