Pattern matching in pseudo real-time

DOI10.1016/J.JDA.2010.09.005zbMath1216.68346OpenAlexW2085185260MaRDI QIDQ533411

Benjamin Sach, Raphaël Clifford

Publication date: 3 May 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2010.09.005

zbMATH Keywords

online algorithmdistance functionapproximate pattern matching

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (2)

Dictionary Matching in a Stream ⋮ Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching with address errors: rearrangement distances
• Fast string matching with k differences
• Alphabet dependence in parameterized matching
• Overlap matching.
• Swap and mismatch edit distance
• Self-normalised Distance with Don’t Cares
• A Black Box for Online Approximate Pattern Matching
• Algorithms for approximate string matching
• String Matching in Real Time
• Fast Pattern Matching in Strings
• Incremental String Comparison
• Function Matching
• Fast on-line integer multiplication

This page was built for publication: Pattern matching in pseudo real-time