Longest Gapped Repeats and Palindromes

DOI10.1007/978-3-662-48057-1_16zbMath1465.68314arXiv1511.07180OpenAlexW1460107350MaRDI QIDQ2946337

Marius Dumitran, Florin Manea, Paweł Gawrychowski

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial pattern matchinggapped palindromesgapped repeats

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (7)

Subsequences in bounded ranges: matching and analysis problems ⋮ 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 ⋮ Efficient computation of longest single-arm-gapped palindromes in a string ⋮ Efficient representation and counting of antipower factors in words

Cites Work

• Unnamed Item
• Searching for gapped palindromes
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Computing the longest previous factor
• Computing longest previous non-overlapping factors
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Linear work suffix array construction
• A Minimal Periods Algorithm with Applications
• Algorithms on Strings, Trees and Sequences
• Searching of Gapped Repeats and Subrepetitions in a Word
• Mathematical Foundations of Computer Science 2003

This page was built for publication: Longest Gapped Repeats and Palindromes