Using swaps and deletes to make strings match

DOI10.1016/j.tcs.2014.11.002zbMath1303.68099OpenAlexW2035127050MaRDI QIDQ476911

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

zbMATH Keywords

polynomial timestring-to-string correctionstring edit distance

Mathematics Subject Classification ID

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

Related Items (1)

Adaptive Computation of the Swap-Insert Correction Distance

Cites Work

• Unnamed Item
• Charge and reduce: A fixed-parameter algorithm for string-to-string correction
• Interchange rearrangement: the element-cost model
• An Extension of the String-to-String Correction Problem
• The String-to-String Correction Problem
• On the Cost of Interchange Rearrangement in Strings

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