Name
Abstract | ||
|---|---|---|
RNA locally optimal secondary structures provide a concise and exhaustive description of all possible secondary structures of a given RNA sequence, and hence a very good representation of the RNA folding space. In this paper, we present an efficient algorithm that computes all locally optimal secondary structures for any folding model that takes into account the stability of helical regions. This algorithm is implemented in a software called regliss that runs on a publicly accessible web server. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1089/cmb.2010.0178 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
algorithms,computational molecular biology,dynamic programming,RNA secondary structure | RNA,Dynamic programming,RNA Sequence,Computational molecular biology,Computer science,Rna folding,Theoretical computer science,Software,Bioinformatics,Nucleic acid secondary structure,Web server | Journal |
Volume | Issue | ISSN |
19.0 | 10 | 1066-5277 |
Citations | PageRank | References |
7 | 0.60 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Azadeh Saffarian | 1 | 7 | 1.28 |
| Mathieu Giraud | 2 | 124 | 15.28 |
| Antoine de Monte | 3 | 16 | 1.52 |
| Hélène Touzet | 4 | 292 | 20.96 |