A fixed-parameter algorithm for string-to-string correction

  • Authors:

  • Faisal N. Abu-Khzam;Henning Fernau;Michael A. Langston;Serena Lee-Cultura;Ulrike Stege

  • Affiliations:

  • Lebanese American University, Lebanon;Universität Trier, Trier, Germany;University of Tennessee;University of Victoria, Canada;University of Victoria, Canada

  • Venue:
  • CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the String-to-String Correction problem we are given two strings x and y and a positive integer k, and are asked whether it is possible to transform y into x with at most k single character deletions and adjacent character exchanges. We present a first simple fixed-parameter algorithm for String-to-String Correction that runs in O*(2k). Moreover, we present a search tree algorithm that exhibits a novel technique of bookkeeping called charging, which leads to an improved algorithm whose running time is in O*(1.62k).