What Makes the Arc-Preserving Subsequence Problem Hard? - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

What Makes the Arc-Preserving Subsequence Problem Hard?

Résumé

Given two arc-annotated sequences (S, P ) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S, P ) by deleting some of its bases (together with their incident arcs, if any). In previous studies [3, 6], this problem has been naturally divided into subproblems reflecting intrinsic complexity of arc structures. We show that APS(Crossing, Plain) is NP-complete, thereby answering an open problem [6]. Furthermore, to get more insight into where actual border of APS hardness is, we refine APS classical subproblems in much the same way as in [11] and give a complete categorization among various restrictions of APS problem complexity.
Fichier principal
Vignette du fichier
hal.pdf (239.81 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00620359 , version 1 (30-09-2011)

Identifiants

  • HAL Id : hal-00620359 , version 1

Citer

Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. What Makes the Arc-Preserving Subsequence Problem Hard?. 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868. ⟨hal-00620359⟩
275 Consultations
162 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More