Skip to main content
Springer Nature Link
Log in

Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems

  • Conference paper
String Processing and Information Retrieval (SPIRE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6393))

Included in the following conference series:

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 to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baeza-Yates, R.A.: Searching subsequences. Theoritical Computer Science 78, 363–376 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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)

    Article  MathSciNet  MATH  Google Scholar 

  3. Apostolico, A., Guerral, C.: The longest common subsequence problem revisited. Algorithmica 2, 315–336 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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)

    Google Scholar 

  5. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: String Processing and Information Retrieval (SPIRE), pp. 39–48 (2000)

    Google Scholar 

  6. Chen, Y.-C., Chao, K.-M.: On the generaized constrained longest common subsequence problem. Journal of Combinatorial Optimization (2009)

    Google Scholar 

  7. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT press, McGraw-Hill, New York (2001)

    MATH  Google Scholar 

  8. 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)

    Google Scholar 

  9. Gotthilf, Z., Hermelin, D., Landau, G.M., Lewinstein, M.: Restricted lcs. In: Accepted in String Processing and Information Retrieval, SPIRE (2010)

    Google Scholar 

  10. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory,Languages, and Computation, 2nd edn. Pearson Education, London (2001)

    MATH  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Iliopoulos, C.S., Rahman, M.S.: New efficient algorithms for the lcs and constrained lcs problem. Information Processing Letters 106, 13–18 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  14. Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. Journal of Computer and System Sciences 20(1), 18–31 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tsai, Y.-T.: The constrained longest common subsequence problem. Information Processing Letters 88(4), 173–176 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wagner, R.A., Fischer, M.J.: The string to string correction problem. Journal of the ACM 21(1), 168–173 (1974)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AℓEDA Group, Department of Computer Science and Engineering (CSE), Bangladesh University of Engineering and Technology (BUET), Dhaka, 1000, Bangladesh

    Effat Farhana, Jannatul Ferdous, Tanaeem Moosa & M. Sohel Rahman

Authors
  1. Effat Farhana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jannatul Ferdous
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tanaeem Moosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Physics and Mathematics, Edificio "B", Universidad Michoacana, Ciudad Universitaria, 5800, Morelia, Mich., Mexico

    Edgar Chavez

  2. Dept. of Computer Science and Enginerring, University of California, 92521, Riverside, CA, USA

    Stefano Lonardi

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics