Skip to main content
SpringerLink
Log in

Searching for Gapped Palindromes

  • Conference paper
Combinatorial Pattern Matching (CPM 2008)

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

Included in the following conference series:

Abstract

We study the problem of finding, in a given word, all maximal gapped palindromes verifying two types of constraints, that we call long-armed and length-constrained palindromes. For both classes, we propose algorithms that run in time O(n + S), where S is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allouche, J.-P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theor. Comput. Sci. 292(1), 9–31 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 497–506. Springer, Heidelberg (1994)

    Google Scholar 

  3. Biedl, T., Buss, J., Demaine, E., Demaine, M., Hajiaghayi, M., Vinar, T.: Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3), 475–480 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers 18, 349–365 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cook, S.: Linear time simulation of deterministic two-way pushdown automata. In: Proceedings of the 5th World Computer Congress, IFIP 1971, Ljubljana, Yugoslavia, August 23-28, 1971, Vol. 1, pp. 75–80 (1971)

    Google Scholar 

  7. Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)

    MATH  Google Scholar 

  8. De Luca, A., De Luca, A.: Palindromes in Sturmian words. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 199–208. Springer, Heidelberg (2005)

    Google Scholar 

  9. Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theoret. Comput. Sci. 223, 73–85 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Droubay, X.: Palindromes in the Fibonacci word. Information Processing Letters 55(4), 217–221 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Galil, Z.: Palindrome recognition in real time by a multitape turing machine. Journal of Computer and System Sciences 16(2), 140–157 (1978)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  13. Kolpakov, R., Kucherov, G.: Finding repeats with fixed gap. In: Proceedings of the 7th International Symposium on String Processing and Information Retrieval (SPIRE), A Coruña, Spain, September 27-29, 2000, pp. 162–168. IEEE, Los Alamitos (2000)

    Chapter  Google Scholar 

  14. Kolpakov, R., Kucherov, G.: On maximal repetitions in words. Journal of Discrete Algorithms 1(1), 159–186 (2000)

    MathSciNet  Google Scholar 

  15. Kolpakov, R., Kucherov, G.: Identification of periodic structures in words. In: Berstel, J., Perrin, D. (eds.) Applied combinatorics on words, Encyclopedia of Mathematics and its Applications. Lothaire books, ch.8, vol. 104, pp. 430–477. Cambridge University Press, Cambridge (2005)

    Google Scholar 

  16. Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6, 323–350 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943–955. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Lu, L., Jia, H., Dröge, P., Li, J.: The human genome-wide distribution of DNA palindromes. Functional and Integrative Genomics 7(3), 221–227 (2007)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  21. Slisenko, A.O.: Recognition of palindromes by multihead turing machines. In: Orverkov, V.P., Sonin, N.A. (eds.) Problems in the Constructive Trend in Mathematics VI, Proceedings of the Steklov Institute of Mathematics, vol. 129, pp. 30–202 (1973)

    Google Scholar 

  22. Slissenko, A.: A simplified proof of real-time recognizability of palindromes on Turing machines. J. of Soviet Mathematics 15(1), 68–77 (1981); Russian original. In: Zapiski Nauchnykh Seminarov LOMI, vol. 68, pp. 123–139 (1977)

    Google Scholar 

  23. van de Snepscheut, J., Swenker, J.: On the design of some systolic algorithms. J. ACM 36(4), 826–840 (1989)

    Article  MATH  Google Scholar 

  24. Warburton, P.E., Giordano, J., Cheung, F., Gelfand, Y., Benson, G.: Inverted repeat structure of the human genome: The X-chromosome contains a preponderance of large, highly homologous inverted repeats that contain testes genes. Genome Research 14, 1861–1869 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow University, 119899, Moscow, Russia

    Roman Kolpakov

  2. LIFL/CNRS/INRIA, Parc scientifique de la Haute Borne, 40, Avenue Halley, 59650, Villeneuve d’Ascq, France

    Gregory Kucherov

Authors
  1. Roman Kolpakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gregory Kucherov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paolo Ferragina Gad M. Landau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolpakov, R., Kucherov, G. (2008). Searching for Gapped Palindromes. In: Ferragina, P., Landau, G.M. (eds) Combinatorial Pattern Matching. CPM 2008. Lecture Notes in Computer Science, vol 5029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69068-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69068-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69066-5

  • Online ISBN: 978-3-540-69068-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation