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 (Q1702853): Difference between revisions
From MaRDI portal
Latest revision as of 04:56, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
scientific article |
Statements
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 (English)
0 references
1 March 2018
0 references
combinatorics on words
0 references
counting algorithms
0 references
0 references
0 references
