Oxfold: kinetic folding of RNA using stochastic context-free grammars and evolutionary information

被引:13
|
作者
Anderson, James W. J. [1 ]
Haas, Pierre A. [2 ]
Mathieson, Leigh-Anne [3 ]
Volynkin, Vladimir [4 ]
Lyngso, Rune [1 ]
Tataru, Paula [5 ]
Hein, Jotun [1 ]
机构
[1] Univ Oxford, Dept Stat, Oxford OX1 3TG, England
[2] Univ Cambridge, Dept Appl Math & Theoret Phys, Cambridge CB3 0WA, England
[3] Univ British Columbia, Dept Comp Sci, Vancouver, BC V6T 1Z4, Canada
[4] European Bioinformat Inst, Hinxton CB10 1SD, Cambs, England
[5] Aarhus Univ, Bioinformat Res Ctr, DK-8000 Aarhus C, Denmark
基金
英国生物技术与生命科学研究理事会; 英国工程与自然科学研究理事会;
关键词
SECONDARY STRUCTURE PREDICTION; WEB SERVER; MODELS;
D O I
10.1093/bioinformatics/btt050
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Many computational methods for RNA secondary structure prediction, and, in particular, for the prediction of a consensus structure of an alignment of RNA sequences, have been developed. Most methods, however, ignore biophysical factors, such as the kinetics of RNA folding; no current implementation considers both evolutionary information and folding kinetics, thus losing information that, when considered, might lead to better predictions. Results: We present an iterative algorithm, Oxfold, in the framework of stochastic context-free grammars, that emulates the kinetics of RNA folding in a simplified way, in combination with a molecular evolution model. This method improves considerably on existing grammatical models that do not consider folding kinetics. Additionally, the model compares favourably to non-kinetic thermodynamic models. Availability: http://www.stats.ox.ac.uk/similar to anderson. Contact: anderson@stats.ox.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.
引用
收藏
页码:704 / 710
页数:7
相关论文
共 50 条
  • [41] On restricted context-free grammars
    Dassow, Juergen
    Masopust, Tomas
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (01) : 293 - 304
  • [42] Ordered Context-Free Grammars
    van der Merwe, Brink
    Berglund, Martin
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2022), 2022, 13266 : 53 - 66
  • [43] On Restricted Context-Free Grammars
    Dassow, Juergen
    Masopust, Tomas
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 434 - +
  • [44] PREDICTORS OF CONTEXT-FREE GRAMMARS
    TAI, KC
    SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 653 - 664
  • [45] CONTEXT-FREE GRAPH GRAMMARS
    DELLAVIGNA, P
    GHEZZI, C
    INFORMATION AND CONTROL, 1978, 37 (02): : 207 - 233
  • [46] ORDERED CONTEXT-FREE GRAMMARS
    LEPISTO, T
    INFORMATION AND CONTROL, 1973, 22 (01): : 56 - 68
  • [47] On Muller context-free grammars
    Esik, Zoltan
    Ivan, Szabolcs
    THEORETICAL COMPUTER SCIENCE, 2012, 416 : 17 - 32
  • [48] On a construction of context-free grammars
    Martinek, Pavel
    Fundamenta Informaticae, 2000, 44 (03) : 245 - 264
  • [49] ON CONTEXT-FREE PROGRAMMED GRAMMARS
    SEBESTA, RW
    COMPUTER LANGUAGES, 1989, 14 (02): : 99 - 108
  • [50] MINIMIZATION OF CONTEXT-FREE GRAMMARS
    Ryazanov, Yu D.
    Nazina, S., V
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (45): : 90 - 96