RCPred: RNA complex prediction as a constrained maximum weight clique problem

被引:7
|
作者
Legendre, Audrey [1 ]
Angel, Eric [1 ]
Tahi, Fariza [1 ]
机构
[1] Univ Paris Saclay, Univ Evry, IBISC, F-91025 Evry, France
关键词
RNA complex; Secondary structure; RNA interaction; Pseudoknot; Maximum weight clique heuristic; SECONDARY STRUCTURE PREDICTION; ACCURATE PREDICTION; DESIGN; ACCESSIBILITY; ALGORITHMS; SEARCH; MOTIFS;
D O I
10.1186/s12859-019-2648-1
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
BackgroundRNAs can interact and form complexes, which have various biological roles. The secondary structure prediction of those complexes is a first step towards the identification of their 3D structure. We propose an original approach that takes advantage of the high number of RNA secondary structure and RNA-RNA interaction prediction tools. We formulate the problem of RNA complex prediction as the determination of the best combination (according to the free energy) of predicted RNA secondary structures and RNA-RNA interactions.ResultsWe model those predicted structures and interactions as a graph in order to have a combinatorial optimization problem that is a constrained maximum weight clique problem. We propose an heuristic based on Breakout Local Search to solve this problem and a tool, called RCPred, that returns several solutions, including motifs like internal and external pseudoknots. On a large number of complexes, RCPred gives competitive results compared to the methods of the state of the art.ConclusionsWe propose in this paper a method called RCPred for the prediction of several secondary structures of RNA complexes, including internal and external pseudoknots. As further works we will propose an improved computation of the global energy and the insertion of 3D motifs in the RNA complexes.
引用
收藏
页数:10
相关论文
共 50 条
  • [31] Solving the maximum edge weight clique problem via unconstrained quadratic programming
    Alidaee, Bahram
    Glover, Fred
    Kochenberger, Gary
    Wang, Haibo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (02) : 592 - 597
  • [32] On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
    Brandstadt, Andreas
    Hoang, Chinh T.
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 295 - 306
  • [33] New applications of clique separator decomposition for the Maximum Weight Stable Set problem
    Brandstaedt, Andreas
    Le, Van Bang
    Mahfud, Suhail
    THEORETICAL COMPUTER SCIENCE, 2007, 370 (1-3) : 229 - 239
  • [34] New applications of clique separator decomposition for the maximum weight stable set problem
    Brandstädt, A
    Le, VB
    Mahfud, S
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 516 - 527
  • [35] A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem
    Jiang, Hua
    Li, Chu-Min
    Liu, Yanli
    Manya, Felip
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 1338 - 1346
  • [36] The combinatorics of pivoting for the maximum weight clique
    Locatelli, M
    Bomze, IM
    Pelillo, M
    OPERATIONS RESEARCH LETTERS, 2004, 32 (06) : 523 - 529
  • [37] Solving the maximum vertex weight clique problem via binary quadratic programming
    Wang, Yang
    Hao, Jin-Kao
    Glover, Fred
    Lu, Zhipeng
    Wu, Qinghua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (02) : 531 - 549
  • [38] On clique separators, nearly chordal graphs, and the maximum weight stable set problem
    Brandstädt, A
    Hoàng, CT
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3509 : 265 - 275
  • [39] A new DNA-based approach to solve the maximum weight clique problem
    Han, Aili
    Zhu, Daming
    COMPUTATIONAL INTELLIGENCE AND BIOINFORMATICS, PT 3, PROCEEDINGS, 2006, 4115 : 320 - 327
  • [40] Solving the maximum vertex weight clique problem via binary quadratic programming
    Yang Wang
    Jin-Kao Hao
    Fred Glover
    Zhipeng Lü
    Qinghua Wu
    Journal of Combinatorial Optimization, 2016, 32 : 531 - 549