Pages that link to "Item:Q1102764"
From MaRDI portal
The following pages link to A new distance metric on strings computable in linear time (Q1102764):
Displaying 7 items.
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Generalized quasi-metric on strings (Q1991838) (← links)
- (Q5110893) (← links)