Extending the Hardness of RNA Secondary Structure Comparison

Abstract : In molecular biology, RNA structure comparison is of great interest to help solving problems as different as phylogeny reconstruction, prediction of molecule folding and identification of a function common to a set of molecules. Lin et al. [6] proposed to define a similarity cri- terion between RNA structures using a concept of edit distance ; they named the corresponding problem Edit. Recently, Blin et al. [3] showed that another problem, the Longest Arc-Preserving Common Subsequence problem (or Lapcs), is in fact a subproblem of Edit. This relationship between those two problems induces the hardness of what was the last open case for the Edit problem, Edit(Nested,Nested), which corresponds to computing the edit distance between two secondary structures without pseudoknots. Nevertheless, Lapcs is a very restricted subproblem of Edit: in particular, it corresponds to a given system of editing costs, whose biological relevance can be discussed ; hence, giving a more precise categorization of the computational complexity of the Edit problem remains of interest. In this paper, we answer this question by showing that Edit(Nested,Nested) is NP-complete for a large class of instances, not overlapping with the ones used in the proof for Lapcs, and which represent more biologically relevant cost systems.
Type de document :
Communication dans un congrès
Chen Bo and Paterson Mike and Zhang Guochuan. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Apr 2007, Hangzhou, China. Springer-Verlag, 4614, pp.140-151, 2007, Lecture Notes in Computer Science (LNCS)
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00418248
Contributeur : Guillaume Fertin <>
Soumis le : jeudi 17 septembre 2009 - 16:32:30
Dernière modification le : jeudi 7 février 2019 - 14:37:44
Document(s) archivé(s) le : mardi 15 juin 2010 - 22:04:37

Fichier

ESCAPE07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00418248, version 1

Citation

Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet. Extending the Hardness of RNA Secondary Structure Comparison. Chen Bo and Paterson Mike and Zhang Guochuan. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Apr 2007, Hangzhou, China. Springer-Verlag, 4614, pp.140-151, 2007, Lecture Notes in Computer Science (LNCS). 〈hal-00418248〉

Partager

Métriques

Consultations de la notice

363

Téléchargements de fichiers

102