One-dimensional approximate point set pattern matching with \(L_p\)-norm
From MaRDI portal
Publication:389940
DOI10.1016/j.tcs.2013.11.022zbMath1358.68349OpenAlexW2084272690MaRDI QIDQ389940
Publication date: 22 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.022
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric applications of a matrix-searching algorithm
- Point set pattern matching in \(d\)-dimensions
- Approximate matching in the \(L_{\infty }\) metric
- \(L_{1}\) pattern matching lower bound
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A linear space algorithm for computing maximal common subsequences
- Combinatorial Pattern Matching