Two algorithms for LCS Consecutive Suffix Alignment
Under an Elsevier user license
open archive
Keywords
Dynamic programming
Longest common subsequence
Match point arithmetic
Incremental algorithms
Cited by (0)
- 1
Partially supported by NSF grant CCR-0104307, and by the Israel Science Foundation grants 282/01 and 35/05.
- 2
Fax: +510 643 8443.
- 3
Partially supported by the Aly Kaufman Post Doctoral Fellowship and by the Bar-Nir Bergreen Software Technology Center of Excellence.
Copyright © 2007 Elsevier Inc. All rights reserved.