Abstract
The problem of aligning two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence similarity problem is the incremental string comparison problem, denoted Consecutive Suffix Alignment, which is, given two strings A and B, to compute the alignment solution of each suffix of A versus B.
Here, we present two solutions to the Consecutive Suffix Alignment Problem under the LCS metric. The first solution is an O(nL) time and space algorithm for constant alphabets, where n is the size of the compared strings and L ≤ n denotes the size of the LCS of A and B.
The second solution is an O(n L + n log|Σ|) time and O(L) space algorithm for general alphabets, where Σ denotes the alphabet of the compared strings. (Note that |Σ| ≤ n.)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostolico, A.: String editing and longest common subsequences. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Berlin, vol. 2, pp. 361–398. Springer, Heidelberg (1997)
Apostolico, A., Guerra, C.: The longest common subsequence problem revisited. Algorithmica 2, 315–336 (1987)
Carmel, D., Efraty, N., Landau, G.M., Maarek, Y.S., Mass, Y.: An Extension of the Vector Space Model for Querying XML Documents via XML Fragments. In: ACM SIGIR 2002 Workshop on XML and IR, Tampere, Finland (August 2002)
Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse Dynamic Programming I: Linear Cost Functions. JACM 39, 546–567 (1992)
Hirshberg, D.S.: Algorithms for the longest common subsequence problem. JACM 24(4), 664–675 (1977)
Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Communications of the ACM 20, 350–353 (1977)
Kim, S., Park, K.: A Dynamic Edit Distance Table.In: Proc. 11th Annual Symposium On Combinatorial Pattern Matching, pp. 60–68 (2000)
Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557–582 (1998)
Landau, G.M., Ziv-Ukelson, M., 804–814: On the Shared Substring Alignment Problem. In: Proc. Symposium On Discrete Algorithms, pp. 804–814 (2000)
Landau, G.M., Ziv-Ukelson, M.: On the Common Substring Alignment Problem. Journal of Algorithms 41(2), 338–359 (2001)
Landau, G.M., Schieber, B., Ziv-Ukelson, M.: Sparse LCS Common Substring Alignment. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 225–236. Springer, Heidelberg (2003)
Myers, E.W.: Incremental Alignment Algorithms and their Applications. Tech. Rep. 86-22, Dept. of Computer Science, U. of Arizona (1986)
Myers, E.W.: An O(ND) Difference Algorithm and its Variants. Algorithmica 1(2), 251–266 (1986)
Schmidt, J.P.: All Highest Scoring Paths In Weighted Grid Graphs and Their Application To Finding All Approximate Repeats In Strings. SIAM J. Comput 27(4), 972–992 (1998)
Sim, J.S., Iliopoulos, C.S., Park, K.: Approximate Periods of Strings. In: Proc. 10th Annual Symposium On Combinatorial Pattern Matching, pp. 132–137 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Landau, G.M., Myers, E., Ziv-Ukelson, M. (2004). Two Algorithms for LCS Consecutive Suffix Alignment. In: Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds) Combinatorial Pattern Matching. CPM 2004. Lecture Notes in Computer Science, vol 3109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27801-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-27801-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22341-2
Online ISBN: 978-3-540-27801-6
eBook Packages: Springer Book Archive