Faster queries for longest substring palindrome after block edit
From MaRDI portal
Publication:5088918
DOI10.4230/LIPIcs.CPM.2019.27zbMath1497.68600OpenAlexW2918947454MaRDI QIDQ5088918
Yuto Nakashima, Mitsuru Funakoshi, Shunsuke Inenaga, Masayuki Takeda, Hideo Bannai
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2019.27
Related Items (5)
Dynamic and internal longest common substring ⋮ Computing longest palindromic substring after single-character or block-wise edits ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ Repetition Detection in a Dynamic String ⋮ Longest common substring made fully dynamic
Cites Work
- Unnamed Item
- Unnamed Item
- Counting distinct palindromes in a word in linear time
- The level ancestor problem simplified
- Parallel detection of all palindromes in a string
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Searching for gapped palindromes
- Finding level-ancestors in trees
- 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
- Dynamic and internal longest common substring
- Suffix Arrays: A New Method for On-Line String Searches
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Algorithms on Strings, Trees and Sequences
- Longest substring palindrome after edit
- Longest Lyndon Substring After Edit
- Longest Common Factor After One Edit Operation
- Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
- On the sorting-complexity of suffix tree construction
This page was built for publication: Faster queries for longest substring palindrome after block edit
