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
相关论文
共 49 条
  • [21] Speeding up branch and bound algorithms for solving the maximum clique problem
    Maslov, Evgeny
    Batsyn, Mikhail
    Pardalos, Panos M.
    JOURNAL OF GLOBAL OPTIMIZATION, 2014, 59 (01) : 1 - 21
  • [22] Stochastic maximum weight forest problem
    Adasme, Pablo
    Andrade, Rafael
    Letournel, Marc
    Lisser, Abdel
    NETWORKS, 2015, 65 (04) : 289 - 305
  • [23] An opposition-based memetic algorithm for the maximum quasi-clique problem
    Zhou, Qing
    Benlic, Una
    Wu, Qinghua
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 286 (01) : 63 - 83
  • [24] A stem weight maximization scheme for RNA pseudoknot prediction
    Leo, Yean Ling
    Goh, Yong Kheng
    2012 IEEE Conference on Sustainable Utilization and Development in Engineering and Technology (STUDENT), 2012, : 176 - 181
  • [25] Brain EEG Time-Series Clustering Using Maximum-Weight Clique
    Dai, Chenglong
    Wu, Jia
    Pi, Dechang
    Becker, Stefanie, I
    Cui, Lin
    Zhang, Qin
    Johnson, Blake
    IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (01) : 357 - 371
  • [26] The minmax regret inverse maximum weight problem
    Kien Trung Nguyen
    Nguyen Thanh Hung
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 407
  • [27] Approximating the maximum multiple RNA interaction problem
    Tong, Weitian
    Goebel, Randy
    Liu, Tian
    Lin, Guohui
    THEORETICAL COMPUTER SCIENCE, 2014, 556 : 63 - 70
  • [28] A new family of facet defining inequalities for the maximum edge-weighted clique problem
    Fomeni, Franklin Djeumou
    OPTIMIZATION LETTERS, 2017, 11 (01) : 47 - 54
  • [29] An optimization algorithm for maximum quasi-clique problem based on information feedback model
    Liu, Shuhong
    Zhou, Jincheng
    Wang, Dan
    Zhang, Zaijun
    Lei, Mingjie
    PEERJ COMPUTER SCIENCE, 2024, 10
  • [30] An extension of adaptive multi-start tabu search for the maximum quasi-clique problem
    Djeddi, Youcef
    Haddadene, Hacene Ait
    Belacel, Nabil
    COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 132 : 280 - 292