Skip to main content
SpringerLink
Log in

Longest Gapped Repeats and Palindromes

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2015 (MFCS 2015)

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

Abstract

A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, \(u^Rvu\)) of w. We show how to compute efficiently, for every position i of the word w, the longest prefix u of w[i..n] such that uv (respectively, \(u^Rv\)) is a suffix of \(w[1..i-1]\) (defining thus a gapped repeat uvu – respectively, palindrome \(u^Rvu\)), and the length of v is subject to various types of restrictions.

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 EPUB and 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

References

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

    Book  MATH  Google Scholar 

  2. Brodal, G.S., Lyngsø, R.B., Pedersen, C.N.S., Stoye, J.: Finding maximal pairs with bounded gap. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 134–149. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Kolpakov, R.M., Kucherov, G.: Finding repeats with fixed gap. In: Proceedings of SPIRE, pp. 162–168 (2000)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Kolpakov, R., Podolskiy, M., Posypkin, M., Khrapov, N.: Searching of gapped repeats and subrepetitions in a word. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 212–221. Springer, Heidelberg (2014)

    Google Scholar 

  6. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rytter, W., Waleń, T.: Efficient algorithms for two extensions of LPF table: the power of suffix arrays. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 296–307. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Crochemore, M., Tischler, G.: Computing longest previous non-overlapping factors. Inf. Process. Lett. 111, 291–295 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Walen, T.: Computing the longest previous factor. Eur. J. Comb. 34, 15–26 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of FOCS, pp. 596–604 (1999)

    Google Scholar 

  10. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53, 918–936 (2006)

    Article  MathSciNet  Google Scholar 

  11. Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: Proceeding of STOC, pp. 246–251 (1983)

    Google Scholar 

  12. Duval, J.-P., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A.: Linear-time computation of local periods. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 388–397. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Kosaraju, S.R.: Computation of squares in a string (preliminary version). In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807, pp. 146–150. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  14. Xu, Z.: A minimal periods algorithm with applications. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 51–62. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Crochemore, M., Rytter, W.: Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays. Theoret. Comput. Sci. 88, 59–82 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kociumaka, T., Radoszewski, J., Rytter, W., Waleń, T.: Efficient data structures for the factor periodicity problem. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 284–294. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014, Bucharest, Romania

    Marius Dumitran

  2. Department of Computer Science, Christian-Albrechts University of Kiel, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Florin Manea

Authors
  1. Marius Dumitran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florin Manea
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florin Manea .

Editor information

Editors and Affiliations

  1. Università di Roma "Tor Vergata", Rome, Italy

    Giuseppe F Italiano

  2. Università degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

  3. University of Edinburgh, Edinburgh, United Kingdom

    Donald T. Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dumitran, M., Manea, F. (2015). Longest Gapped Repeats and Palindromes. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48057-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48057-1_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48056-4

  • Online ISBN: 978-3-662-48057-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation