Swap and mismatch edit distance
From MaRDI portal
Publication:2369878
DOI10.1007/s00453-005-1192-8zbMath1117.68085OpenAlexW2139235994MaRDI QIDQ2369878
Estrella Eisenberg, Amihood Amir, 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
Related Items
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ Isometric words based on swap and mismatch distance ⋮ Hypercubes and isometric words based on swap and mismatch distance ⋮ String matching with up to \(k\) swaps and mismatches ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Restricted and swap common superstring: a multivariate algorithmic perspective ⋮ Pattern matching in pseudo real-time ⋮ On the hardness of maximum rank aggregation problems
Cites Work