Pages that link to "Item:Q3506947"
From MaRDI portal
The following pages link to Approximate String Matching with Address Bit Errors (Q3506947):
Displaying 8 items.
- Approximate string matching with stuck address bits (Q551176) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Interchange rearrangement: the element-cost model (Q732021) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
