An unbiased adaptive sampling algorithm for the exploration of RNA mutational landscapes under evolutionary pressure

Jérôme Waldispühl 1, * Yann Ponty 2, 3, *
* Auteur correspondant
2 AMIB - Algorithms and Models for Integrative Biology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : The analysis of the relationship between sequences and structures (i.e. how mutations aect structures and reciprocally how structures in uence mutations) is essential to decipher the principles driving molecular evolution, to infer the origins of genetic diseases or to develop bioengineering applications such as the design of articial molecules. Because their structures can be predicted from the sequence data only, RNA molecules provide a good framework to study this sequence-structure relationship. We recently introduced a suite of algorithms called RNAmutants which allows, for the rst time, a complete exploration of RNA sequence-structure maps in polynomial time and space. Formally, RNAmutants takes an input sequence (or seed) to compute the Boltzmann weighted ensembles of mutants with exactly k mutations, and sample mutations from these ensembles. However, this approach suers from major limitations. Indeed, since the Boltzmann probabilities of the mutations depend of the free energy of the structures, RNAmutants has diculties to sample mutant sequences with low G+C-contents. In this paper we introduce a novel unbiased adaptive sampling algorithm that enables RNAmutants to sample regions of the mutational landscape poorly covered by classical algorithms. We applied these methods to sample mutations with low G+C-contents. These adaptive sampling techniques can be easily adapted to explore other regions of the sequence and structural landscapes which are dif- cult to sample. Importantly, these algorithms come at a minimal computational cost. We demonstrate the insights oered by these techniques on studies of complete RNA sequence structures maps of sizes up to 40 nucleotides. Our results indicate that the G+C-content has a strong in uence on the size and shape of the evolutionary accessible sequence and structural spaces. In particular, we show that low G+C-contents favor the apparition of internal loops and thus possibly the synthesis of tertiary structure motifs. On the other hand, high G+C-contents signicantly reduce the size of the evolutionary accessible mutational landscapes.
Type de document :
Communication dans un congrès
Bafna, Vineet and Sahinalp, S. RECOMB - 15th Annual International Conference on Research in Computational Molecular Biology - 2011, Mar 2011, Vancouver, Canada. Springer Berlin / Heidelberg, 6577, pp.501-515, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-20036-6_45〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00546847
Contributeur : Yann Ponty <>
Soumis le : mardi 14 décembre 2010 - 22:29:11
Dernière modification le : jeudi 7 février 2019 - 15:47:48
Document(s) archivé(s) le : mardi 15 mars 2011 - 05:19:37

Fichiers

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

Identifiants

Collections

Citation

Jérôme Waldispühl, Yann Ponty. An unbiased adaptive sampling algorithm for the exploration of RNA mutational landscapes under evolutionary pressure. Bafna, Vineet and Sahinalp, S. RECOMB - 15th Annual International Conference on Research in Computational Molecular Biology - 2011, Mar 2011, Vancouver, Canada. Springer Berlin / Heidelberg, 6577, pp.501-515, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-20036-6_45〉. 〈hal-00546847〉

Partager

Métriques

Consultations de la notice

587

Téléchargements de fichiers

274