Swap and mismatch edit distance
From MaRDI portal
Publication:2369878
DOI10.1007/S00453-005-1192-8zbMATH Open1117.68085OpenAlexW2139235994MaRDI QIDQ2369878FDOQ2369878
Authors: Amihood Amir, Estrella Eisenberg, Ely Porat 
Publication date: 21 June 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1192-8
Recommendations
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Overlap matching.
- Approximate swapped matching.
- Generalized String Matching
- An Extension of the String-to-String Correction Problem
- Fast parallel and serial approximate string matching
- Efficient string matching with k mismatches
- Title not available (Why is that?)
- Title not available (Why is that?)
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
- Algorithms – ESA 2004
- Restricted and swap common superstring: a multivariate algorithmic perspective
- The approximate swap and mismatch edit distance
- 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)
