Abstract
The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. Given strings S 1, S 2 and P, the generalized constrained longest common subsequence problem (GC-LCS) for S 1 and S 2 with respect to P is to find a longest common subsequence of S 1 and S 2, which contains (excludes) P as a subsequence (substring). We present finite automata based algorithms with time complexity O(r(n + m) + (n + m) log(n + m) ) for a fixed sized alphabet, where r, n and m are the lengths of P, S 1 and S 2 respectively.
This research work constitutes part of the undergraduate thesis work of the first and second authors under the supervision of the last author. Authors’ names are in alphabetic order.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R.A.: Searching subsequences. Theoritical Computer Science 78, 363–376 (1991)
Aho, A.V., Hirchberg, D., Ullman, J.D.: Bounds on the complexity of longest common subsequence problem. Journal of the ACM 23, 1–12 (1976)
Apostolico, A., Guerral, C.: The longest common subsequence problem revisited. Algorithmica 2, 315–336 (1987)
Arslan, A.N., Eğecioğlu, Ö: Algorithms for the constrained longest common subsequence problems. International Journal of Foundations Computer Science 16(6), 1099–1109 (2005)
Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: String Processing and Information Retrieval (SPIRE), pp. 39–48 (2000)
Chen, Y.-C., Chao, K.-M.: On the generaized constrained longest common subsequence problem. Journal of Combinatorial Optimization (2009)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT press, McGraw-Hill, New York (2001)
Santis, A.D., Chin, F.Y.L., Ferrara, A.L.: A simple algorithm for the constrained longest common sequence problem. Information Processing Letters 90, 175–179 (2003)
Gotthilf, Z., Hermelin, D., Landau, G.M., Lewinstein, M.: Restricted lcs. In: Accepted in String Processing and Information Retrieval, SPIRE (2010)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory,Languages, and Computation, 2nd edn. Pearson Education, London (2001)
Iliopoulos, C.S., Rahman, M.S., Voráček, M., Vagner, L.: Computing constrained longest common subsequence for degenerate strings using finite automata. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 309–311. Springer, Heidelberg (2007)
Iliopoulos, C.S., Rahman, M.S.: New efficient algorithms for the lcs and constrained lcs problem. Information Processing Letters 106, 13–18 (2008)
Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice-Hall, Englewood Cliffs (1998)
Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. Journal of Computer and System Sciences 20(1), 18–31 (1980)
Tsai, Y.-T.: The constrained longest common subsequence problem. Information Processing Letters 88(4), 173–176 (2003)
Wagner, R.A., Fischer, M.J.: The string to string correction problem. Journal of the ACM 21(1), 168–173 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farhana, E., Ferdous, J., Moosa, T., Rahman, M.S. (2010). Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems. In: Chavez, E., Lonardi, S. (eds) String Processing and Information Retrieval. SPIRE 2010. Lecture Notes in Computer Science, vol 6393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16321-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-16321-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16320-3
Online ISBN: 978-3-642-16321-0
eBook Packages: Computer ScienceComputer Science (R0)