Combinatorial Pattern Matching

DOI10.1007/b137128zbMath1131.68583OpenAlexW4301315466MaRDI QIDQ5713570

Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos

Publication date: 14 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137128

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (17)

Set intersection and sequence matching with mismatch counting ⋮ Approximate matching in the \(L_{\infty }\) metric ⋮ \(L_{1}\) pattern matching lower bound ⋮ A Black Box for Online Approximate Pattern Matching ⋮ Order-preserving matching ⋮ Unnamed Item ⋮ Approximate pattern matching with \(k\)-mismatches in packed text ⋮ Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ On approximate pattern matching with thresholds ⋮ Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching ⋮ A black box for online approximate pattern matching ⋮ Hamming Distance Completeness ⋮ Approximating Approximate Pattern Matching ⋮ Unnamed Item ⋮ Order-preserving pattern matching indeterminate strings ⋮ Recent advances in text-to-pattern distance algorithms

This page was built for publication: Combinatorial Pattern Matching