Using swaps and deletes to make strings match

DOI10.1016/J.TCS.2014.11.002zbMATH Open1303.68099OpenAlexW2035127050MaRDI QIDQ476911FDOQ476911

Authors: Daniel Meister 

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.002

Recommendations

• Efficient algorithms for approximate string matching with swaps
• scientific article; zbMATH DE number 2080211
• Approximate swapped matching.
• Algorithms – ESA 2004
• Swap and mismatch edit distance

zbMATH Keywords

polynomial timestring-to-string correctionstring edit distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Cites Work

• The String-to-String Correction Problem
• An Extension of the String-to-String Correction Problem
• Charge and reduce: A fixed-parameter algorithm for string-to-string correction
• Title not available (Why is that?)
• On the cost of interchange rearrangement in strings
• Interchange rearrangement: the element-cost model

This page was built for publication: Using swaps and deletes to make strings match

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476911)