Clustering strings with mutations using an expectation-maximization algorithm In the context of RNA structure prediction - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Poster Année : 2019

Clustering strings with mutations using an expectation-maximization algorithm In the context of RNA structure prediction

Résumé

In comparative analysis, an RNA structure (a set of base pairs and unpaired nucleotides) is predicted from a set of RNA variants (similar sequences) under the assumption of the conservation of the structure during evolution. The combination of RNA variants with Experimental data informing about the local (nucleotide) structure may lead to more accurate structure prediction. The experimental protocol consists of mutating nucleotides likely to be 'unpaired'. A simultaneous reading of RNA variants sequences that underwent the experimental mutation protocol lead to the following issue: How to cluster 'mutated' substrings of similar parent strings such that each substring is correctly assigned to its parent string? We developed an Expectation Maximization algorithm that uses Mutational profiles (mutation distributions) to assign the substrings to their strings of origin.
Fichier principal
Vignette du fichier
Poster.pdf (853.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02332313 , version 1 (24-10-2019)

Identifiants

  • HAL Id : hal-02332313 , version 1

Citer

Afaf Saaidi, Yann Ponty, Mireille Regnier. Clustering strings with mutations using an expectation-maximization algorithm In the context of RNA structure prediction. 34th Clemson Mini-Conference on Discrete Mathematics and Algorithms, Oct 2019, Clemson, United States. ⟨hal-02332313⟩
51 Consultations
84 Téléchargements

Partager

Gmail Facebook X LinkedIn More