The following pages link to Combinatorial Pattern Matching (Q5713573):
Displaying 20 items.
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- Pattern matching in the Hamming distance with thresholds (Q1944111) (← links)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- Approximate matching in the \(L_{\infty }\) metric (Q2380061) (← links)
- \(L_{1}\) pattern matching lower bound (Q2380062) (← links)
- Modulated string searching (Q2437743) (← links)
- Order-preserving matching (Q2437748) (← links)
- On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance (Q5002739) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- Approximating Approximate Pattern Matching (Q5088905) (← links)
- (Q5140763) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
