Publication:3024804
From MaRDI portal
zbMath1063.68614MaRDI QIDQ3024804
Christian N. S. Pedersen, Rune B. Lyngsø, Gerth Stølting Brodal, Jens Stoye
Publication date: 4 July 2005
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68W05: Nonnumerical algorithms
68R15: Combinatorics on words
Related Items
Small-space LCE data structure with constant-time queries, Maximal closed substrings, Reporting consecutive substring occurrences under bounded gap constraints, Counting maximal-exponent factors in words, Computing maximal-exponent factors in an overlap-free word, Discovering subword associations in strings in time linear in the output size, On maximal repeats in strings, Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes, 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, Algorithms for extracting motifs from biological weighted sequences, Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints, Longest Gapped Repeats and Palindromes, Longest $$\alpha $$-Gapped Repeat and Palindrome, A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String