Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats

DOI10.1007/978-3-319-30000-9_19zbMath1443.68137OpenAlexW2746659992WikidataQ58064455 ScholiaQ58064455MaRDI QIDQ2798724

Maxime Crochemore, Gregory Kucherov, Roman M. Kolpakov

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_19

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (10)

Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes ⋮ Upper bounds on distinct maximal (sub-)repetitions in compressed strings ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ Searching of gapped repeats and subrepetitions in a word ⋮ Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings ⋮ 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 ⋮ Some results on the number of periodic factors in words ⋮ Efficient representation and counting of antipower factors in words ⋮ Small-space LCE data structure with constant-time queries

This page was built for publication: Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats