Palindrome pattern matching
From MaRDI portal
Publication:390901
DOI10.1016/J.TCS.2012.01.047zbMATH Open1292.68183OpenAlexW2174831371MaRDI QIDQ390901FDOQ390901
Masayuki Takeda, Tomohiro I, Shunsuke Inenaga
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.047
Recommendations
Pattern recognition, speech recognition (68T10) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Palindromic richness
- Palindrome complexity.
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Episturmian words and some constructions of de Luca and Rauzy
- New trie data structures which support very fast search operations
- Surpassing the information theoretic bound with fusion trees
- On-line construction of suffix trees
- Parameterized pattern matching: Algorithms and applications
- Total palindrome complexity of finite words
- Searching for gapped palindromes
- Burrows-Wheeler transform and palindromic richness
- Finding all approximate gapped palindromes
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Counting distinct palindromes in a word in linear time
Cited In (5)
This page was built for publication: Palindrome pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390901)