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 条
  • [1] RCPred: RNA complex prediction as a constrained maximum weight clique problem
    Audrey Legendre
    Eric Angel
    Fariza Tahi
    BMC Bioinformatics, 20
  • [2] ON THE MAXIMUM WEIGHT CLIQUE PROBLEM
    BALAS, E
    CHVATAL, V
    NESETRIL, J
    MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (03) : 522 - 535
  • [3] Fast algorithm for the maximum weight clique problem
    Babel, L.
    Computing (Vienna/New York), 1994, 52 (01): : 31 - 38
  • [4] A FAST ALGORITHM FOR THE MAXIMUM WEIGHT CLIQUE PROBLEM
    BABEL, L
    COMPUTING, 1994, 52 (01) : 31 - 38
  • [5] A new upper bound for the maximum weight clique problem
    Li, Chu-Min
    Liu, Yanli
    Jiang, Hua
    Manya, Felip
    Li, Yu
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (01) : 66 - 77
  • [6] Grenade Explosion Method for Maximum Weight Clique Problem
    Pallantla, Manohar
    Singh, Alok
    CONTEMPORARY COMPUTING, 2012, 306 : 20 - 27
  • [7] An Evolutionary Approach to the Maximum Edge Weight Clique Problem
    Fontes, Dalila B. M. M.
    Goncalves, Jose Fernando
    Fontes, Fernando A. C. C.
    RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING, 2018, 11 (03) : 260 - 266
  • [8] A complementary pivoting approach to the maximum weight clique problem
    Massaro, A
    Pelillo, M
    Bomze, IM
    SIAM JOURNAL ON OPTIMIZATION, 2002, 12 (04) : 928 - 948
  • [9] A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
    Hosseinian, Seyedmohammadhossein
    Fontes, Dalila B. M. M.
    Butenko, Sergiy
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (03) : 747 - 762
  • [10] Minimum clique partition problem with constrained weight for interval graphs
    Li, Jianbo
    Chen, Mingxia
    Li, Jianping
    Li, Weidong
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 459 - 468