Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
From MaRDI portal
(Redirected from Publication:1702853)
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
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
Recommendations
- Improved upper bounds on all maximal -gapped repeats and palindromes
- A faster algorithm for computing maximal \(\alpha \)-gapped repeats in a string
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Optimal bounds for computing \(\alpha\)-gapped repeats
- Efficiently finding all maximal \(\alpha\)-gapped repeats
- Almost linear time computation of maximal repetitions in run length encoded strings
- Longest \(\alpha \)-gapped repeat and palindrome
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
Cites work
- scientific article; zbMATH DE number 2185638 (Why is no real title available?)
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- A faster algorithm for computing maximal \(\alpha \)-gapped repeats in a string
- Algorithms on Strings, Trees and Sequences
- Computing longest previous non-overlapping factors
- Computing maximal-exponent factors in an overlap-free word
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Efficiently finding all maximal \(\alpha\)-gapped repeats
- Finding pseudo-repetitions
- Linear work suffix array construction
- Longest \(\alpha \)-gapped repeat and palindrome
- Making deterministic signatures quickly
- Optimal bounds for computing \(\alpha\)-gapped repeats
- Searching for gapped palindromes
- Searching of Gapped Repeats and Subrepetitions in a Word
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Testing generalised freeness of words
- The ``runs theorem
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Cited in
(16)- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Longest substring palindrome after edit
- A faster algorithm for computing maximal \(\alpha \)-gapped repeats in a string
- Universal reconstruction of a string
- Improved upper bounds on all maximal -gapped repeats and palindromes
- Searching of gapped repeats and subrepetitions in a word
- Some results on the number of periodic factors in words
- Optimal bounds for computing \(\alpha\)-gapped repeats
- Maximal closed substrings
- Minimal unique palindromic substrings after single-character substitution
- Computing longest palindromic substring after single-character or block-wise edits
- Internal pattern matching queries in a text and applications
- Efficiently finding all maximal \(\alpha\)-gapped repeats
- Faster queries for longest substring palindrome after block edit
- Efficient computation of longest single-arm-gapped palindromes in a string
- Longest \(\alpha \)-gapped repeat and palindrome
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702853)
