scientific article; zbMATH DE number 6691399
From MaRDI portal
Publication:2965480
Recommendations
- Approximate On-line Palindrome Recognition, and Applications
- Identifying approximate palindromes in run-length encoded strings
- Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
- Tight tradeoffs for real-time approximation of longest palindromes in streams
- Parallel detection of all palindromes in a string
- Efficient Computation of Palindromes in Sequences with Uncertainties*
- Efficient retrieval of approximate palindromes in a run-length encoded string
- Finding approximate palindromes in strings
- Palindrome pattern matching
Cited in
(16)- The derivation of on-line algorithms, with an application to finding palindromes
- Palindrome recognition using a multidimensional tape.
- Computing the maximum exponent in a stream
- Computing longest palindromic substring after single-character or block-wise edits
- Tight tradeoffs for real-time approximation of longest palindromes in streams
- Palindrome pattern matching
- Streaming periodicity with mismatches
- Faster queries for longest substring palindrome after block edit
- Searching Long Repeats in Streams
- Palindromic length in linear time
- Streaming for aibohphobes: longest palindrome with mismatches
- Approximate On-line Palindrome Recognition, and Applications
- Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
- Finding palindromes: variants and algorithms
- Double-ended palindromic trees in linear time
- Small-space algorithms for the online language distance problem for palindromes and squares
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965480)
