Pages that link to "Item:Q5150915"
From MaRDI portal
The following pages link to Longest Common Factor After One Edit Operation (Q5150915):
Displaying 14 items.
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. (Q5140774) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- (Q6065473) (← links)
- Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)