The following pages link to (Q4250214):
Displayed 10 items.
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Efficient algorithms for the block edit problems (Q963999) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Overlap matching. (Q1401926) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)