scientific article

zbMath1063.68614MaRDI QIDQ3024804

Christian N. S. Pedersen, Rune B. Lyngsø, Gerth Stølting Brodal, Jens Stoye

Publication date: 4 July 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (14)

Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes ⋮ Reporting consecutive substring occurrences under bounded gap constraints ⋮ 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 ⋮ Computing maximal-exponent factors in an overlap-free word ⋮ Maximal closed substrings ⋮ 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 ⋮ Counting maximal-exponent factors in words ⋮ Discovering subword associations in strings in time linear in the output size ⋮ Small-space LCE data structure with constant-time queries ⋮ On maximal repeats in strings

This page was built for publication: