scientific article; zbMATH DE number 7278103

DOI10.4230/LIPIcs.FSTTCS.2017.31zbMath1491.68277arXiv1705.01887MaRDI QIDQ5136323

Elena Grigorescu, Samson Zhou, Azer Erfan Sadeqi

Publication date: 25 November 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamming distancestreaming algorithmslongest palindrome with mismatches

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (2)

Unnamed Item ⋮ Searching Long Repeats in Streams

Cites Work

• Unnamed Item
• A black box for online approximate pattern matching
• Real-Time Streaming String-Matching
• Improved Sketching of Hamming Distance with Error Correcting
• Efficient randomized pattern-matching algorithms
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• The k-mismatch problem revisited
• Faster algorithms for string matching with k mismatches
• Exact and Approximate Pattern Matching in the Streaming Model
• Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
• Homomorphic fingerprints under misalignments

This page was built for publication: