Searching for Gapped Palindromes
From MaRDI portal
Publication:3506939
DOI10.1007/978-3-540-69068-9_5zbMath1143.68631WikidataQ58064510 ScholiaQ58064510MaRDI QIDQ3506939
Gregory Kucherov, Roman M. Kolpakov
Publication date: 17 June 2008
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_5
Related Items
Efficient algorithms for three variants of the LPF table, Efficient computation of maximal anti-exponent in palindrome-free strings, Finding maximal 2-dimensional palindromes, Time-space trade-offs for longest common extensions, Time-Space Trade-Offs for Longest Common Extensions, Longest Common Extensions in Sublinear Space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Palindrome recognition in real time by a multitape Turing machine
- Palindromes in the Fibonacci word
- Palindrome recognition using a multidimensional tape.
- Palindrome complexity.
- Finding approximate palindromes in strings
- Finding all periods and initial palindromes of a string in parallel
- Palindromes and Sturmian words
- On the design of some systolic algorithms
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Fast Pattern Matching in Strings
- Algorithms on Strings, Trees and Sequences
- Developments in Language Theory
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
