A Black Box for Online Approximate Pattern Matching

DOI10.1007/978-3-540-69068-9_15zbMath1143.68625OpenAlexW2099283146MaRDI QIDQ3506949

Ely Porat, Raphaël Clifford, Benny Porat, Klim Efremenko

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (4)

On pattern matching with \(k\) mismatches and few don't cares ⋮ On string matching with mismatches ⋮ Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model ⋮ Pattern matching in pseudo real-time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple deterministic wildcard matching
• Efficient string matching with k mismatches
• Approximate string matching for music analysis
• Efficient 2-dimensional approximate matching of half-rectangular figures
• Communication complexity of sum-type functions invariant under translation
• k-Mismatch with Don’t Cares
• Verifying candidate matches in sparse and wildcard matching
• Generalized String Matching
• Faster image template matching in the sum of the absolute value of differences measure
• Faster algorithms for string matching with k mismatches
• Combinatorial Pattern Matching
• Combinatorial Pattern Matching

This page was built for publication: A Black Box for Online Approximate Pattern Matching