The following pages link to (Q4808933):
Displaying 7 items.
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Classes of cost functions for string edit distance (Q1355732) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- The graph matching problem (Q2444585) (← links)
- A Probabilistic Analysis of a String Editing Problem and its Variations (Q4852430) (← links)
- (Q5110893) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)