Longest substring palindrome after edit
From MaRDI portal
Publication:5140775
DOI10.4230/LIPIcs.CPM.2018.12zbMath1497.68599OpenAlexW2806239363MaRDI QIDQ5140775
Hideo Bannai, Yuto Nakashima, Masayuki Takeda, Mitsuru Funakoshi, Shunsuke Inenaga
Publication date: 16 December 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2018.12
Related Items (8)
The heaviest induced ancestors problem: better data structures and applications ⋮ Dynamic and internal longest common substring ⋮ Computing longest palindromic substring after single-character or block-wise edits ⋮ Repetition Detection in a Dynamic String ⋮ Bidirectional Text Compression in External Memory ⋮ Longest property-preserved common factor: a new string-processing framework ⋮ Longest common substring made fully dynamic ⋮ Faster queries for longest substring palindrome after block edit
Cites Work
- Unnamed Item
- Counting distinct palindromes in a word in linear time
- Parallel detection of all palindromes in a string
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- 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
- Finding approximate palindromes in strings
- On-line construction of suffix trees
- Computing Longest Single-arm-gapped Palindromes in a String
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Algorithms on Strings, Trees and Sequences
- Efficient algorithms for Lempel-Ziv encoding
- Longest Common Factor After One Edit Operation
- Dynamic LCA Queries on Trees
- On the sorting-complexity of suffix tree construction
This page was built for publication: Longest substring palindrome after edit
