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

Abstract : 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.
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00417918
Contributor : Guillaume Fertin <>
Submitted on : Thursday, September 17, 2009 - 11:53:17 AM
Last modification on : Wednesday, May 23, 2018 - 3:44:02 PM
Document(s) archivé(s) le : Tuesday, June 15, 2010 - 11:49:17 PM

File

BSBFinal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00417918, version 1

Citation

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⟩

Share

Metrics

Record views

327

Files downloads

133