Grammatical representations of macromolecular structure

被引:21
作者
Chiang, David
Joshi, Aravind K.
Searls, David B.
机构
[1] Univ So Calif, Inst Informat Sci, Marina Del Rey, CA 90292 USA
[2] Univ Penn, Dept Informat & Comp Sci, Philadelphia, PA 19104 USA
[3] GlaxoSmithKline, Genet Res, Bioinformat Div, King Of Prussia, PA USA
关键词
computational linguistics; formal grammars; tree-adjoining grammars;
D O I
10.1089/cmb.2006.13.1077
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Since the first application of context-free grammars to RNA secondary structures in 1988, many researchers have used both ad hoc and formal methods from computational linguistics to model RNA and protein structure. We show how nearly all of these methods are based on the same core principles and can be converted into equivalent approaches in the framework of tree-adjoining grammars and related formalisms. We also propose some new approaches that extend these core principles in novel ways.
引用
收藏
页码:1077 / 1100
页数:24
相关论文
共 52 条
[1]   Predicting protein secondary structure using stochastic tree grammars [J].
Abe, N ;
Mamitsuka, H .
MACHINE LEARNING, 1997, 29 (2-3) :275-301
[2]   Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots [J].
Akutsu, T .
DISCRETE APPLIED MATHEMATICS, 2000, 104 (1-3) :45-62
[3]  
[Anonymous], 1999, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
[4]  
[Anonymous], 2003, RES LANGUAGE COMPUTA
[5]  
[Anonymous], 2012, Introduction to protein structure
[6]  
[Anonymous], 2000, P 6 INT WORKSH PARS
[7]  
BECKER T, 1991, FIFTH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, P21
[8]  
BERTSCH E, 2001, P 7 INT WORKSH PARS, P66
[9]  
Berwick R. C., 1984, Computational Linguistics, V10, P189
[10]  
Boullier P, 1999, NINTH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS, P53