Longest $$\alpha $$-Gapped Repeat and Palindrome
From MaRDI portal
Publication:2947867
DOI10.1007/978-3-319-22177-9_3zbMath1433.68631OpenAlexW1494229095MaRDI QIDQ2947867
Paweł Gawrychowski, Florin Manea
Publication date: 29 September 2015
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_3
Related Items (4)
The undirected repetition threshold and undirected pattern avoidance ⋮ Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets ⋮ On the number of gapped repeats with arbitrary gap ⋮ Optimal bounds for computing \({\alpha}\)-gapped repeats
Cites Work
- Unnamed Item
- Searching for gapped palindromes
- An optimal algorithm for computing the repetitions in a word
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Computing longest previous non-overlapping factors
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Linear work suffix array construction
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Algorithms on Strings, Trees and Sequences
- Searching of Gapped Repeats and Subrepetitions in a Word
- A new characterization of maximal repetitions by Lyndon trees
This page was built for publication: Longest $$\alpha $$-Gapped Repeat and Palindrome
