Abstract
In this paper, we present a finite automata based algorithm for solving the constrained longest common subsequence problem for degenerate strings. A string is a sequence of symbols from a given alphabet Σ. A subsequence u of a string x is obtained by deleting some characters from u (not necessarily contiguous). Given two strings x and y, u is a common subsequence of x and y, if u is a subsequence of both x and y. And, u is a longest common subsequence (LCS) of x and y, if it is the longest among all such subsequences. Given two strings x and y, the LCS problem aims to compute a longest common subsequence of them. We study a newer variant of the classic LCS problem, namely the Constrained LCS problem (CLCS). In CLCS, the computed longest common subsequence must also be a supersequence of a third given string, say z [3,2,1].
Partially supported by the Ministry of Education under research program MSM 6840770014 and the Czech Science Foundation as project No. 201/06/1039.
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
References
Chin, F.Y.L., De Santis, A., Ferrara, A.L., Ho, N.L., Kim, S.K.: A simple algorithm for the constrained sequence problems. Inf. Process. Lett. 90(4), 175–179 (2004)
Arslan, A.N., Egecioglu, Ö.: Algorithms for the constrained longest common subsequence problems. Int. J. Found. Comput. Sci. 16(6), 1099–1109 (2005)
Tsai, Y.T.: The constrained common subsequence problem. Inf. Process. Lett. 88, 173–176 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iliopoulos, C., Rahman, M.S., Voráček, M., Vagner, L. (2007). The Constrained Longest Common Subsequence Problem for Degenerate Strings. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-76336-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76335-2
Online ISBN: 978-3-540-76336-9
eBook Packages: Computer ScienceComputer Science (R0)