Title |
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approach
|
---|---|
Published in |
Algorithms for Molecular Biology, August 2011
|
DOI | 10.1186/1748-7188-6-20 |
Pubmed ID | |
Authors |
Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson |
Abstract |
RNA secondary structure prediction is a mainstream bioinformatic domain, and is key to computational analysis of functional RNA. In more than 30 years, much research has been devoted to defining different variants of RNA structure prediction problems, and to developing techniques for improving prediction quality. Nevertheless, most of the algorithms in this field follow a similar dynamic programming approach as that presented by Nussinov and Jacobson in the late 70's, which typically yields cubic worst case running time algorithms. Recently, some algorithmic approaches were applied to improve the complexity of these algorithms, motivated by new discoveries in the RNA domain and by the need to efficiently analyze the increasing amount of accumulated genome-wide data. |
Mendeley readers
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 8 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 38% |
Student > Master | 2 | 25% |
Professor | 1 | 13% |
Student > Doctoral Student | 1 | 13% |
Researcher | 1 | 13% |
Other | 0 | 0% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 63% |
Biochemistry, Genetics and Molecular Biology | 1 | 13% |
Agricultural and Biological Sciences | 1 | 13% |
Engineering | 1 | 13% |