Approximate matching in the \(L_{\infty }\) metric

DOI10.1016/j.ipl.2007.08.012zbMath1184.68643OpenAlexW1519092730MaRDI QIDQ2380061

Ely Porat, Ohad Lipsky

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.012

zbMATH Keywords

analysis of algorithmstime series analysispattern matchingapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Approximation algorithms (68W25)

Related Items (6)

Approximate matching in the \(L_{\infty }\) metric ⋮ One-dimensional approximate point set pattern matching with \(L_p\)-norm ⋮ Order-preserving matching ⋮ Unnamed Item ⋮ Order-preserving pattern matching indeterminate strings ⋮ Recent advances in text-to-pattern distance algorithms

Cites Work

• Approximate matching in the \(L_{\infty }\) metric
• Combinatorial pattern matching. 16th annual symposium, CPM 2005, Jeju Island, Korea, June 19--22, 2005. Proceedings.
• Automata, Languages and Programming
• Combinatorial Pattern Matching
• Combinatorial Pattern Matching
• Unnamed Item

This page was built for publication: Approximate matching in the \(L_{\infty }\) metric