Pages that link to "Item:Q3581523"
From MaRDI portal
The following pages link to Pattern matching with address errors (Q3581523):
Displaying 11 items.
- Approximate string matching with stuck address bits (Q551176) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Interchange rearrangement: the element-cost model (Q732021) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Indexing Circular Patterns (Q5452151) (← links)
