Tree adjoining grammars for RNA structure prediction

DOI10.1016/S0304-3975(98)00090-5zbMath0912.68121MaRDI QIDQ1274602

Takashi Yokomori, Satoshi Kobayashi, Yasuo Uemura, Aki Hasegawa

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

RNA secondary structures; tree adjoining grammars; parsing algorithms; RNA structure prediction

Mathematics Subject Classification ID

68N20: Theory of compilers and interpreters

68Q42: Grammars and rewriting systems

Related Items

Languages as hyperplanes: grammatical inference with string kernels, Classifying RNA pseudoknotted structures, Local connectivity of neutral networks, A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class, Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition, Predicting RNA secondary structures with pseudoknots by MCMC sampling, Asymptotic enumeration of RNA structures with pseudoknots, Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges, Combinatorial design of pseudoknot RNA, On pseudoknot-bordered words and their properties, A grammatical approach to RNA-RNA interaction prediction, Stacks in canonical RNA pseudoknot structures, Biocomputing: an insight from linguistics, Combinatorics of RNA structures with pseudoknots

Cites Work

• Tree adjunct grammars
• Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
• On Finding All Suboptimal Foldings of an RNA Molecule