Swap and mismatch edit distance
From MaRDI portal
Publication:2369878
Recommendations
Cites work
- scientific article; zbMATH DE number 3557227 (Why is no real title available?)
- scientific article; zbMATH DE number 1303588 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 1445379 (Why is no real title available?)
- An Extension of the String-to-String Correction Problem
- Approximate swapped matching.
- Efficient string matching with k mismatches
- Fast parallel and serial approximate string matching
- Generalized String Matching
- Introduction to algorithms.
- Overlap matching.
Cited in
(13)- Pattern matching in pseudo real-time
- On the hardness of optimal vertex relabeling and restricted vertex relabeling
- Hypercubes and isometric words based on swap and mismatch distance
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- String matching with up to k swaps and mismatches
- Restricted and swap common superstring: a multivariate algorithmic perspective
- The approximate swap and mismatch edit distance
- Algorithms – ESA 2004
- Isometric words based on swap and mismatch distance
- Using swaps and deletes to make strings match
- On the hardness of maximum rank aggregation problems
- Approximate String Matching with Swap and Mismatch
- Isometric words and edit distance: main notions and new variations
This page was built for publication: Swap and mismatch edit distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369878)