Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2013: Implementation and Application of Automata pp 158–168Cite as

On Palindromic Sequence Automata and Applications

  • Conference paper

  • 723 Accesses

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

Abstract

In this paper, we present a novel weighted finite automata called PSA (Palindromic Subsequence Automata) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the LCPS (Longest Common Palindromic Subsequence) problem. Our automata based algorithms are efficient both in theory and in practice.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14(4), 355–366 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, K.-Y., Hsu, P.-H., Chao, K.-M.: Identifying approximate palindromes in run-length encoded strings. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 339–350. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Choi, C.Q.: Dna palindromes found in cancer. The Scientist (2005)

    Google Scholar 

  4. Chowdhury, S.R., Hasan, M.M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. Fundamneta Informaticae

    Google Scholar 

  5. Chowdhury, S.R., Hasan, M. M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. In: Arumugam, S., Smyth, B. (eds.) IWOCA 2012. LNCS, vol. 7643, pp. 219–223. Springer, Heidelberg (2012)

    Google Scholar 

  6. Chuang, K., Lee, R., Huang, C.: Finding all palindrome subsequences in a string. In: The 24th Workshop on Combinatorial Mathematics and Computation Theory (2007)

    Google Scholar 

  7. Farhana, E., Rahman, M.S.: Doubly-constrained lcs and hybrid-constrained lcs problems revisited. Inf. Process. Lett. 112(13), 562–565 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Galil, Z.: Real-time algorithms for string-matching and palindrome recognition. In: STOC, pp. 161–173 (1976)

    Google Scholar 

  9. Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997)

    Google Scholar 

  10. Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.: Online construction of subsequence automata for multiple texts. In: SPIRE, pp. 146–152 (2000)

    Google Scholar 

  11. Hsu, P.-H., Chen, K.-Y., Chao, K.-M.: Finding all approximate gapped palindromes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1084–1093. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. I., T., Inenaga, S., Takeda, M.: Palindrome pattern matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 232–245. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Iliopoulos, C.S., Rahman, M.S., Vorácek, M., Vagner, L.: Finite automata based algorithms on subsequences and supersequences of degenerate strings. J. Discrete Algorithms 8(2), 117–130 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kolpakov, R., Kucherov, G.: Searching for gapped palindromes. Theor. Comput. Sci. 410(51), 5365–5373 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Manacher, G.K.: A new linear-time “on-line” algorithm for finding the smallest initial palindrome of a string. J. ACM 22(3), 346–351 (1975)

    Article  MATH  Google Scholar 

  16. Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., Hashimoto, K.: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8-10), 900–913 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Melicher, B., Holub, J., Muzatko, P.: Language and Translation. Publishing House of CTU (1997)

    Google Scholar 

  18. Porto, A.H.L., Barbosa, V.C.: Finding approximate palindromes in strings. Pattern Recognition 35(11), 2581–2591 (2002)

    Article  MATH  Google Scholar 

  19. Tanaka, H., Tapscott, S.J., Trask, B.J., Yao, M.C.: Short inverted repeats initiate gene amplification through the formation of a large dna palindrome in mammalian cells. National Academy of Science 99(13), 8772–8777 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AℓEDA group, Department of CSE, BUET, Dhaka, 1000, Bangladesh

    Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman & Ayon Sen

Authors
  1. Md. Mahbubul Hasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. M. Sohidull Islam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ayon Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Saint Mary’s University, 923 Robie Street, NS B3H 3C3, Halifax, Canada

    Stavros Konstantinidis

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hasan, M.M., Islam, A.S.M.S., Rahman, M.S., Sen, A. (2013). On Palindromic Sequence Automata and Applications. In: Konstantinidis, S. (eds) Implementation and Application of Automata. CIAA 2013. Lecture Notes in Computer Science, vol 7982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39274-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39274-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39273-3

  • Online ISBN: 978-3-642-39274-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation