 |
|
| HAL : hal-00683311, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
| 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Helsinki : Finlande (2012) |
|
|
|
|
| Hardness of longest common subsequence for sequences with bounded run-lengths |
|
|
| Guillaume Blin 1Laurent Bulteau 2 |
|
|
| (07/2012) |
|
|
|
| The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology. This paper focuses on LCS for fixed alphabet size and fixed run-lengths (i.e., maximum number of consecutive occurrences of the same symbol). We show that LCS is NP-complete even when restricted to (i) alphabets of size 3 and run-length at most 1, and (ii) alphabets of size 2 and run-length at most 2 (both results are tight). For the latter case, we show that the problem is approximable within ratio 3/5. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique Gaspard-Monge (LIGM) |
|
|
|
Université Paris-Est Marne-la-Vallée (UPEMLV) – ESIEE – Ecole des Ponts ParisTech – Fédération de Recherche Bézout – CNRS : UMR8049 |
|
|
| 2 : | Laboratoire d'Informatique de Nantes Atlantique (LINA) |
|
|
|
CNRS : UMR6241 – Université de Nantes – École Nationale Supérieure des Mines - Nantes |
|
|
| 3 : | Department of Computer Science, Utah State University (DCS-USU) |
|
|
|
Utah State University, Logan, USA |
|
|
|
|
|
|
|
|
|
| Algorithmics |
|
|
|
|
| Domaine | : | Informatique/Bio-informatique Sciences du Vivant/Bio-Informatique, Biologie Systémique Informatique/Complexité |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00683311, version 1 | |
| http://hal-upec-upem.archives-ouvertes.fr/hal-00683311 | |
| oai:hal-upec-upem.archives-ouvertes.fr:hal-00683311 | |
| Contributeur : Guillaume Blin | |
| Soumis le : Mercredi 28 Mars 2012, 14:14:28 | |
| Dernière modification le : Jeudi 29 Mars 2012, 10:38:09 | |
