Skip to main content
SpringerLink
Log in

EERTREE: An Efficient Data Structure for Processing Palindromes in Strings

  • Conference paper
  • First Online:
Book cover Combinatorial Algorithms (IWOCA 2015)

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

Included in the following conference series:

Abstract

We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure, we present simple and efficient solutions for a number of problems involving palindromes.

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

Notes

  1. 1.

    This structure can be found, with the reference to the first author, in a few IT blogs under the name “palindromic tree”. See, e.g., http://adilet.org/blog/25-09-14/.

References

  1. Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 86–124 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  2. Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theor. Comput. Sci. 255, 539–553 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fici, G., Gagie, T., Kärkkäinen, J., Kempa, D.: A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28, 41–48 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Galil, Z., Seiferas, J.: A linear-time on-line recognition algorithm for “Palstar”. J. ACM 25, 102–111 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  5. Glen, A., Justin, J., Widmer, S., Zamboni, L.: Palindromic richness. Eur. J. Comb. 30(2), 510–531 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Groult, R., Prieur, E., Richomme, G.: Counting distinct palindromes in a word in linear time. Inf. Process. Lett. 110, 908–912 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  8. Kari, L., Mahalingam, K.: Watson—Crick palindromes in DNA computing. Nat. Comput. 9, 297–316 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Kosolobov, D., Rubinchik, M., Shur, A.M.: Finding distinct subpalindromes online. In: Proceedings of the Prague Stringology Conference, PSC 2013, pp. 63–69. Czech Technical University, Prague (2013)

    Google Scholar 

  11. Kosolobov, D., Rubinchik, M., Shur, A.M.: Pal\(^{k}\) is linear recognizable online. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015-Testing. LNCS, vol. 8939, pp. 289–301. Springer, Heidelberg (2015)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Mauri, G., Pavesi, G.: Algorithms for pattern matching and discovery in RNA secondary structure. Theor. Comput. Sci. 335, 29–51 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ravsky, O.: On the palindromic decomposition of binary words. J. Automata Lang. Comb. 8(1), 75–83 (2003)

    MathSciNet  MATH  Google Scholar 

  15. Rubinchik, M., Shur, A.M.: The number of distinct subpalindromes in random words [math.CO] (2015). arXiv:1505.08043

  16. Sloane, N.J.A.: The on-line encyclopedia of integer sequences. http://oeis.org

  17. Strothmann, D.: The affix array data structure and its applications to RNA secondary structure analysis. Theor. Comput. Sci. 389, 278–294 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  19. Problems of Asia-Pacific Informatics Olympiad 2014 (2014). http://olympiads.kz/apio2014/apio2014_problemset.pdf

  20. Problems of the MIPT Fall Programming Training Camp 2014. Contest 12 (2014). https://drive.google.com/file/d/0B_DHLY8icSyNUzRwdkNFa2EtMDQ

Download references

Acknowledgement

The authors thank A. Kul’kov, O. Merkuriev and G. Nazarov for helpful discussions.

Author information

Authors and Affiliations

  1. Ural Federal University, Ekaterinburg, Russia

    Mikhail Rubinchik & Arseny M. Shur

Authors
  1. Mikhail Rubinchik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arseny M. Shur
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arseny M. Shur .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Verona, Verona, Italy

    Zsuzsanna Lipták

  2. Dept. of Computing and Software, McMaster University, Hamilton, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Rubinchik, M., Shur, A.M. (2016). EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. In: Lipták, Z., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2015. Lecture Notes in Computer Science(), vol 9538. Springer, Cham. https://doi.org/10.1007/978-3-319-29516-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29516-9_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29515-2

  • Online ISBN: 978-3-319-29516-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation