Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems

Résumé

In the recent past, RNA structure comparison has appeared as an important field of bioinformatics. In this paper, we introduce a new and general intermediate model for comparing RNA structures: the Maximum Arc-Preserving Common Subsequence problem (or Mapcs). This new model lies between two well-known problems - namely the Longest Arc-Preserving Common Subsequence (Lapcs) and the Edit distance. After showing the relationship between Mapcs, Lapcs, Edit, and also the Maximum Linear Graph problem, we will investigate the computational complexity landscape of Mapcs, depending on the RNA structure complexity.
Fichier principal
Vignette du fichier
BSBFinal.pdf (228.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00417918 , version 1 (17-09-2009)

Identifiants

  • HAL Id : hal-00417918 , version 1

Citer

Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette. Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems. Brazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112. ⟨hal-00417918⟩
161 Consultations
110 Téléchargements

Partager

Gmail Facebook X LinkedIn More