Efficiently Finding All Maximal alpha-gapped Repeats

DOI10.4230/LIPIcs.STACS.2016.39zbMath1380.68320arXiv1509.09237OpenAlexW2963156291MaRDI QIDQ4601891

Florin Manea, Dominik Köppl, Shunsuke Inenaga, Paweł Gawrychowski, Tomohiro I.

Publication date: 24 January 2018

Full work available at URL: https://arxiv.org/abs/1509.09237

zbMATH Keywords

combinatorics on wordscounting algorithms

Mathematics Subject Classification ID

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

Related Items (12)

Upper bounds on distinct maximal (sub-)repetitions in compressed strings ⋮ 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 ⋮ Computing Longest Single-arm-gapped Palindromes in a String ⋮ On the number of gapped repeats with arbitrary gap ⋮ Formulas with reversal ⋮ Optimal bounds for computing \({\alpha}\)-gapped repeats ⋮ Counting maximal-exponent factors in words ⋮ Some results on the number of periodic factors in words ⋮ Finding Gapped Palindromes Online ⋮ Small-space LCE data structure with constant-time queries

This page was built for publication: Efficiently Finding All Maximal alpha-gapped Repeats