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 条
  • [21] Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
    Shimizu, Satoshi
    Yamaguchi, Kazuaki
    Masuda, Sumio
    DISCRETE OPTIMIZATION, 2021, 41
  • [22] A nonconvex quadratic optimization approach to the maximum edge weight clique problem
    Hosseinian, Seyedmohammadhossein
    Fontes, Dalila B. M. M.
    Butenko, Sergiy
    JOURNAL OF GLOBAL OPTIMIZATION, 2018, 72 (02) : 219 - 240
  • [23] A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem
    El Baz, Didier
    Hifi, Mhand
    Wu, Lei
    Shi, Xiaochuan
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 796 - 800
  • [24] Multi-neighborhood tabu search for the maximum weight clique problem
    Wu, Qinghua
    Hao, Jin-Kao
    Glover, Fred
    ANNALS OF OPERATIONS RESEARCH, 2012, 196 (01) : 611 - 634
  • [25] Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
    Wang, Yiyuan
    Cai, Shaowei
    Yin, Minghao
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 805 - 811
  • [26] Multi-neighborhood tabu search for the maximum weight clique problem
    Qinghua Wu
    Jin-Kao Hao
    Fred Glover
    Annals of Operations Research, 2012, 196 : 611 - 634
  • [27] On solving the maximum clique problem
    Kuznetsova, A
    Strekalovsky, A
    JOURNAL OF GLOBAL OPTIMIZATION, 2001, 21 (03) : 265 - 288
  • [28] The maximum clique interdiction problem
    Furini, Fabio
    Ljubic, Ivana
    Martin, Sebastien
    San Segundo, Pablo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (01) : 112 - 127
  • [29] On solving the maximum clique problem
    Antonina Kuznetsova
    Alexander Strekalovsky
    Journal of Global Optimization, 2001, 21 : 265 - 288
  • [30] The maximum ratio clique problem
    Sethuraman S.
    Butenko S.
    Computational Management Science, 2015, 12 (1) : 197 - 218