File Download
Supplementary
-
Citations:
- Appears in Collections:
postgraduate thesis: A general RNA secondary structure algorithm with vertical tree grammar
Title | A general RNA secondary structure algorithm with vertical tree grammar |
---|---|
Authors | |
Advisors | |
Issue Date | 2013 |
Publisher | The University of Hong Kong (Pokfulam, Hong Kong) |
Citation | Liu, X. [刘欣怡]. (2013). A general RNA secondary structure algorithm with vertical tree grammar. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5177352 |
Abstract | Our understanding of the functions played by RNA molecules is expanded with the understanding of RNA structures. Except for primary structure, RNA molecules present pairings within a sequence, which is called RNA secondary structure. Since its discovery, RNA secondary structure has drawn considerable attention because it is widely appeared.
Many programs for RNA secondary structure prediction have been developed, including [4, 20, 38, 39, 46]. Based on our knowledge, however, there is a family of RNA secondary structure which can not be covered by any of these algorithms. And even without considering this family, none of programs can cover all other structures in Rfam data-set. These structures are found to be important in many biological processes, for example, chromosome maintenance, RNA processing, protein biosynthesis. And efficient structure prediction can give direction for experimental investigations. Here, we present a general algorithm with a new grammar: Vertical Tree Grammar (VTG) which has stochastic context-free grammar architecture for RNA secondary structure prediction. VTG significantly expands the class of structures that can be handled, including all structures that can be covered by other paper, and all structures in Rfam data-set. Our algorithm runs in O(n^6) time, and it's precision is reasonable high, with average sensitivity and specificity over
70%. |
Degree | Master of Philosophy |
Subject | Genetic algorithms RNA - Structure |
Dept/Program | Computer Science |
Persistent Identifier | http://hdl.handle.net/10722/196439 |
HKU Library Item ID | b5177352 |
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lam, TW | - |
dc.contributor.advisor | Yiu, SM | - |
dc.contributor.author | Liu, Xinyi | - |
dc.contributor.author | 刘欣怡 | - |
dc.date.accessioned | 2014-04-11T23:14:23Z | - |
dc.date.available | 2014-04-11T23:14:23Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Liu, X. [刘欣怡]. (2013). A general RNA secondary structure algorithm with vertical tree grammar. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5177352 | - |
dc.identifier.uri | http://hdl.handle.net/10722/196439 | - |
dc.description.abstract | Our understanding of the functions played by RNA molecules is expanded with the understanding of RNA structures. Except for primary structure, RNA molecules present pairings within a sequence, which is called RNA secondary structure. Since its discovery, RNA secondary structure has drawn considerable attention because it is widely appeared. Many programs for RNA secondary structure prediction have been developed, including [4, 20, 38, 39, 46]. Based on our knowledge, however, there is a family of RNA secondary structure which can not be covered by any of these algorithms. And even without considering this family, none of programs can cover all other structures in Rfam data-set. These structures are found to be important in many biological processes, for example, chromosome maintenance, RNA processing, protein biosynthesis. And efficient structure prediction can give direction for experimental investigations. Here, we present a general algorithm with a new grammar: Vertical Tree Grammar (VTG) which has stochastic context-free grammar architecture for RNA secondary structure prediction. VTG significantly expands the class of structures that can be handled, including all structures that can be covered by other paper, and all structures in Rfam data-set. Our algorithm runs in O(n^6) time, and it's precision is reasonable high, with average sensitivity and specificity over 70%. | - |
dc.language | eng | - |
dc.publisher | The University of Hong Kong (Pokfulam, Hong Kong) | - |
dc.relation.ispartof | HKU Theses Online (HKUTO) | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.rights | The author retains all proprietary rights, (such as patent rights) and the right to use in future works. | - |
dc.subject.lcsh | Genetic algorithms | - |
dc.subject.lcsh | RNA - Structure | - |
dc.title | A general RNA secondary structure algorithm with vertical tree grammar | - |
dc.type | PG_Thesis | - |
dc.identifier.hkul | b5177352 | - |
dc.description.thesisname | Master of Philosophy | - |
dc.description.thesislevel | Master | - |
dc.description.thesisdiscipline | Computer Science | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.5353/th_b5177352 | - |
dc.identifier.mmsid | 991036763319703414 | - |