scientific article; zbMATH DE number 6691399

DOI10.4230/LIPICS.STACS.2014.149MaRDI QIDQ2965480zbMATH OpenFDO

Authors Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer

Publication date 3 March 2017

Full work available at URL https://arxiv.org/abs/1308.3466

zbMATH Keywords

palindromesstreaming modelcomplementary palindrome

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Algorithms on strings (68W32)

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

(12)

• Palindrome pattern matching
• Computing the maximum exponent in a stream
• Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
• Finding palindromes: variants and algorithms
• Computing longest palindromic substring after single-character or block-wise edits
• Palindromic length in linear time
• Palindrome recognition using a multidimensional tape.
• Faster queries for longest substring palindrome after block edit
• Streaming for aibohphobes: longest palindrome with mismatches
• Streaming periodicity with mismatches
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• Approximate On-line Palindrome Recognition, and Applications

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)