Combinatorial RNA Design - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2016

Combinatorial RNA Design

Résumé

We consider the Combinatorial RNA Design problem, a minimal instance of RNA design where one must produce an RNA sequence that adopts a given secondary structure as its minimal free-energy structure. We consider two free-energy models where the contributions of base pairs are additive and independent: the purely combinatorial Watson-Crick model, which only allows equally-contributing A − U and C − G base pairs, and the real-valued Nussinov-Jacobson model, which associates arbitrary energies to A−U, C − G and G − U base pairs. We first provide a complete characterization of designable structures using restricted alphabets and, in the four-letter alphabet, provide a complete characterization for designable structures without unpaired bases. When unpaired bases are allowed, we characterize extensive classes of (non-)designable structures, and prove the closure of the set of designable structures under the stutter operation. Membership of a given structure to any of the classes can be tested in Θ(n) time, including the generation of a solution sequence for 2 Jozef Haleš et al. positive instances. Finally, we consider a structure-approximating relaxation of the design, and provide a Θ(n) algorithm which, given a structure S that avoids two trivially non-designable motifs, transforms S into a designable structure constructively by adding at most one base-pair to each of its stems. Acknowledgements The authors would like to thank Cédric Chauve (Simon Fraser University) for fruitful discussions and constructive criticisms. YP is greatly indebted to the French Centre National de la Recherche Scientifique and the Pacific Institute for the Mathematical Sciences for funding an extended visit at the Simon Fraser University.
Fichier principal
Vignette du fichier
CombinatorialRNADesign-Hales-Manuch-Ponty-Stacho-Algorithmica-2015.pdf (439.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01285499 , version 1 (09-03-2016)
hal-01285499 , version 2 (01-08-2016)

Licence

Paternité

Identifiants

Citer

Jozef Haleš, Alice Héliou, Ján Maňuch, Yann Ponty, Ladislav Stacho. Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models. Algorithmica, 2016. ⟨hal-01285499v1⟩
656 Consultations
338 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More