Tree adjoining grammars for RNA structure prediction Export

@article{DP3, abstract = {In this paper, we are concerned with identifying a subclass of tree adjoining grammars (TAGs) that is suitable for the application to modeling and predicting RNA secondary structures. The goal of this paper is twofold: For the purpose of applying to the RNA secondary structure prediction problem, we first introduce a special subclass of TAGs and develop a fast parsing algorithm for the subclass, together with some of its language theoretic characterizations. Then, based on the algorithm, we develop a prediction system and demonstrate the effectiveness of the system by presenting some experimental results obtained from biological data, where free energy evaluation selection for parse trees is incorporated into the algorithm.}, author = {Uemura, Yasuo and Hasegawa, Aki and Kobayashi, Satoshi and Yokomori, Takashi}, citeulike-article-id = {652740}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=297759.297763}, citeulike-linkout-1 = {http://dx.doi.org/10.1016/S0304-3975(98)00090-5}, citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B6V1G-3VSPF7C-5/2/6da15dd8ad912ce0d26383506a4401a0}, day = {17}, doi = {10.1016/S0304-3975(98)00090-5}, journal = {Theoretical Computer Science}, keywords = {folding, pseudoknots, rna}, month = {January}, number = {2}, pages = {277--303}, posted-at = {2008-03-26 19:35:41}, priority = {2}, title = {Tree adjoining grammars for RNA structure prediction}, url = {http://dx.doi.org/10.1016/S0304-3975(98)00090-5}, volume = {210}, year = {1999} }

TY - JOUR ID - DP3 L3 - citeulike-article-id:652740 N2 - In this paper, we are concerned with identifying a subclass of tree adjoining grammars (TAGs) that is suitable for the application to modeling and predicting RNA secondary structures. The goal of this paper is twofold: For the purpose of applying to the RNA secondary structure prediction problem, we first introduce a special subclass of TAGs and develop a fast parsing algorithm for the subclass, together with some of its language theoretic characterizations. Then, based on the algorithm, we develop a prediction system and demonstrate the effectiveness of the system by presenting some experimental results obtained from biological data, where free energy evaluation selection for parse trees is incorporated into the algorithm. IS - 2 JF - Theoretical Computer Science EP - 303 TI - Tree adjoining grammars for RNA structure prediction VL - 210 SP - 277 KW - folding KW - pseudoknots KW - rna AU - Uemura, Yasuo AU - Hasegawa, Aki AU - Kobayashi, Satoshi AU - Yokomori, Takashi PY - 1999/01/17/ UR - http://dx.doi.org/10.1016/S0304-3975(98)00090-5 ER -