An FPT-Algorithm for Longest Common Subsequence Parameterized by the Number of Deletions - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Number of Deletions

Résumé

In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find a string that can be obtained from every input string using as few deletions as possible. LCS is one of the most fundamental string problems with numerous applications in various areas, having gained a lot of attention in the algorithms and complexity research community. Significantly improving on an algorithm by Irving and Fraser [CPM'92], featured as a research challenge in a 2014 survey paper, we show that LCS is fixed-parameter tractable when parameterized by the maximum number of deletions per input string. Given the relatively moderate running time of our algorithm (linear time when the parameter is a constant) and small parameter values to be expected in several applications, we believe that our purely theoretical analysis could finally pave the way to a new, exact and practically useful algorithm for this notoriously hard string problem.
Fichier principal
Vignette du fichier
LCS___HAL.pdf (611.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03322887 , version 1 (19-08-2021)

Identifiants

  • HAL Id : hal-03322887 , version 1

Citer

Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau. An FPT-Algorithm for Longest Common Subsequence Parameterized by the Number of Deletions. 2021. ⟨hal-03322887⟩
85 Consultations
89 Téléchargements

Partager

Gmail Facebook X LinkedIn More