Clustering strings with mutations using an expectation-maximization algorithm In the context of RNA structure prediction - Archive ouverte HAL Access content directly
Poster Communications Year :

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

(1) , (1) , (1)
1

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-02332313 , version 1

Cite

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⟩
49 View
69 Download

Share

Gmail Facebook Twitter LinkedIn More