One-dimensional approximate point set pattern matching with \(L_p\)-norm
type: Item
instance of: scholarly article
title: One-dimensional approximate point set pattern matching with \(L_p\)-norm
zbMATH Open document ID: 1358.68349
author: Hung-Lung Wang
author: Kuan-Yu Chen
published in: Theoretical Computer Science
publication date: 2014-01-22T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6248966
zbMATH Keywords: point set pattern matching
zbMATH Keywords: \(L_p\)-norm
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: j.tcs.2013.11.022
OpenAlex ID: W2084272690
cites work: Geometric applications of a matrix-searching algorithm
cites work: Q4508365
cites work: Introduction to algorithms
cites work: Point set pattern matching in \(d\)-dimensions
cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Approximate matching in the \(L_{\infty }\) metric
cites work: \(L_{1}\) pattern matching lower bound
cites work: Q4737694
cites work: Q3992847
cites work: Combinatorial Pattern Matching
DOI: 10.1016/J.TCS.2013.11.022
description: scientific article; zbMATH DE number 6248966