Adaptive Computation of the Swap-Insert Correction Distance

DOI10.1007/978-3-319-23826-5_3zbMath1454.68198arXiv1504.07298OpenAlexW2926933169MaRDI QIDQ2949833

Jérémy Barbay, Pablo Pérez-Lantero

Publication date: 2 October 2015

Published in: ACM Transactions on Algorithms, String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07298

zbMATH Keywords

dynamic programmingedit distanceswapadaptive computationinsert

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (1)

Adaptive Computation of the Swap-Insert Correction Distance

Cites Work

• Unnamed Item
• Unnamed Item
• Charge and reduce: A fixed-parameter algorithm for string-to-string correction
• Using swaps and deletes to make strings match
• Adaptive Computation of the Swap-Insert Correction Distance
• An Extension of the String-to-String Correction Problem
• The String-to-String Correction Problem

This page was built for publication: Adaptive Computation of the Swap-Insert Correction Distance