Longest Gapped Repeats and Palindromes

DOI10.1007/978-3-662-48057-1_16zbMATH Open1465.68314arXiv1511.07180OpenAlexW1460107350MaRDI QIDQ2946337FDOQ2946337

Authors: Marius Dumitran, Florin Manea, Paweł Gawrychowski 

Publication date: 16 September 2015

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

Abstract: A gapped repeat (respectively, palindrome) occurring in a word $w$ is a factor $uvu$ (respectively, $u^{R}vu$) of $w$. In such a repeat (palindrome) $u$ is called the arm of the repeat (respectively, palindrome), while $v$ is called the gap. We show how to compute efficiently, for every position $i$ of the word $w$, the longest gapped repeat and palindrome occurring at that position, provided that the length of the gap is subject to various types of restrictions. That is, that for each position $i$ we compute the longest prefix $u$ of $w[i\mathrm{..}n]$ such that $uv$ (respectively, $u^{R}v$) is a suffix of $w[\mathrm{1..}i-1]$ (defining thus a gapped repeat $uvu$ -- respectively, palindrome $u^{R}vu$), and the length of $v$ is subject to the aforementioned restrictions.

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

Recommendations

• Longest Gapped Repeats and Palindromes
• Longest \(\alpha \)-gapped repeat and palindrome
• Longest arithmetic progressions of palindromes
• Greedy palindromic lengths
• Computing longest single-arm-gapped palindromes in a string
• FINDING ALL APPROXIMATE GAPPED PALINDROMES
• Finding all approximate gapped palindromes
• Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes
• Palindromes in several sequences
• Searching for Gapped Palindromes

zbMATH Keywords

combinatorial pattern matchinggapped palindromesgapped repeats

Mathematics Subject Classification ID

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

Cites Work

• Algorithms on Strings, Trees and Sequences
• Linear work suffix array construction
• Computing the longest previous factor
• Title not available (Why is that?)
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Searching for gapped palindromes
• Computing longest previous non-overlapping factors
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• A minimal periods algorithm with applications
• Searching of Gapped Repeats and Subrepetitions in a Word
• Mathematical Foundations of Computer Science 2003

Cited In (16)

• Optimal bounds for computing \({\alpha}\)-gapped repeats
• Computing longest single-arm-gapped palindromes in a string
• Searching for gapped 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
• On the number of gapped repeats with arbitrary gap
• Finding gapped palindromes online
• Gapped pattern statistics
• Subsequences in bounded ranges: matching and analysis problems
• Counting maximal-exponent factors in words
• Efficient representation and counting of antipower factors in words
• On the expected number of distinct gapped palindromic factors
• Efficient computation of longest single-arm-gapped palindromes in a string
• Searching for Gapped Palindromes
• Efficient computation of maximal anti-exponent in palindrome-free strings
• Longest Gapped Repeats and Palindromes
• Longest \(\alpha \)-gapped repeat and palindrome

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946337)