Skip to Main content Skip to Navigation
Poster communications

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

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.
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-02332313
Contributor : Afaf Saaidi <>
Submitted on : Thursday, October 24, 2019 - 5:05:49 PM
Last modification on : Saturday, January 16, 2021 - 3:27:52 AM
Long-term archiving on: : Saturday, January 25, 2020 - 5:25:05 PM

File

Poster.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02332313, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

78

Files downloads

261