Palindrome Pattern Matching

DOI10.1007/978-3-642-21458-5_21zbMath1339.68333OpenAlexW2116174025MaRDI QIDQ3011857

Masayuki Takeda, Shunsuke Inenaga, Tomohiro I.

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_21

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Palindromic subsequence automata and longest common palindromic subsequence ⋮ Position heaps for Cartesian-tree matching on strings and tries

Cites Work

• Counting distinct palindromes in a word in linear time
• Palindromic richness
• Searching for gapped palindromes
• Total palindrome complexity of finite words
• Palindrome complexity.
• On-line construction of suffix trees
• Parameterized pattern matching: Algorithms and applications
• Burrows-Wheeler transform and palindromic richness
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Finding All Approximate Gapped Palindromes
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Algorithms on Strings, Trees and Sequences
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Palindrome Pattern Matching