The following pages link to Swap and mismatch edit distance (Q2369878):
Displaying 11 items.
- Using swaps and deletes to make strings match (Q476911) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- Algorithms – ESA 2004 (Q5464601) (← links)
- Isometric words and edit distance: main notions and new variations (Q6546059) (← links)
