Pages that link to "Item:Q428850"
From MaRDI portal
The following pages link to Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850):
Displaying 10 items.
- Palindromic rich words and run-length encodings (Q738876) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- 2-dimensional palindromes with \(k\) mismatches (Q2203604) (← links)
- (Q2965480) (← links)
- Efficient Computation of Palindromes in Sequences with Uncertainties* (Q4611213) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- Approximate On-line Palindrome Recognition, and Applications (Q5165587) (← links)
- Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. (Q5369553) (← links)