Tree adjoining grammars for RNA structure prediction

Yasuo Uemura, Aki Hasegawa, Satoshi Kobayashi, Takashi Yokomori

研究成果: Article

129 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)277-303
ページ数27
ジャーナルTheoretical Computer Science
210
発行部数2
出版物ステータスPublished - 1999 1 17
外部発表Yes

    フィンガープリント

ASJC Scopus subject areas

  • Computational Theory and Mathematics

これを引用

Uemura, Y., Hasegawa, A., Kobayashi, S., & Yokomori, T. (1999). Tree adjoining grammars for RNA structure prediction. Theoretical Computer Science, 210(2), 277-303.