Searching of Gapped Repeats and Subrepetitions in a Word

DOI10.1007/978-3-319-07566-2_22zbMath1407.68382arXiv1309.4055OpenAlexW2109455522MaRDI QIDQ5165607

Nickolay Khrapov, Mikhail L. Podolsky, Mikhail A. Posypkin, Roman M. Kolpakov

Publication date: 30 June 2014

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (11)

Universal Reconstruction of a String ⋮ Searching of gapped repeats and subrepetitions in a word ⋮ Longest Gapped Repeats and Palindromes ⋮ Longest $$\alpha $$-Gapped Repeat and Palindrome ⋮ A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String ⋮ Subsequence covers of words ⋮ 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 ⋮ Counting maximal-exponent factors in words ⋮ Computing the maximum exponent in a stream

This page was built for publication: Searching of Gapped Repeats and Subrepetitions in a Word