Pages that link to "Item:Q5900366"
From MaRDI portal
The following pages link to On the Cost of Interchange Rearrangement in Strings (Q5900366):
Displayed 7 items.
- 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)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Transposition Rearrangement: Linear Algorithm for Length-Cost Model (Q5406676) (← links)