Population-based meta-heuristic for active modules identification

被引:2
|
作者
Correa, Leandro [1 ]
Pallez, Denis [1 ]
Tichit, Laurent [2 ]
Soriani, Olivier [3 ]
Pasquier, Claude [1 ]
机构
[1] Univ Cote dAzur, CNRS, I3S, Biot, France
[2] Aix Marseille Univ, CNRS, Cent Marseille, I2M, Marseille, France
[3] Univ Cote dAzur, CNRS, INSERM, iBV, Biot, France
关键词
active module identification; transcriptome analysis; protein-protein interaction; differential expression; NSGA-II; INTERACTION NETWORKS; EXPRESSION; GENES;
D O I
10.1145/3365953.3365957
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
The identification of condition specific gene sets from transcriptomic experiments has important biological applications, ranging from the discovery of altered pathways between different phenotypes to the selection of disease-related biomarkers. Statistical approaches using only gene expression data are based on an overly simplistic assumption that the genes with the most altered expressions are the most important in the process under study. However, a phenotype is rarely a direct consequence of the activity of a single gene, but rather reflects the interplay of several genes to perform certain molecular processes. Many methods have been proposed to analyze gene activity in the light of our knowledge about their molecular interactions. We propose, in this article, a population-based meta-heuristics based on new crossover and mutation operators. Our method achieves state of the art performance in an independent simulation experiment used in other studies. Applied to a public transcriptomic dataset of patients afflicted with Hepato cellular carcinoma, our method was able to identify significant modules of genes with meaningful biological relevance.
引用
收藏
页数:8
相关论文
共 50 条
  • [31] A Meta-heuristic Based Clustering Mechanism for Wireless Sensor Networks
    Krishna, M. P. Nidhish
    Abirami, K.
    ADVANCES IN COMPUTING AND DATA SCIENCES (ICACDS 2022), PT II, 2022, 1614 : 332 - 345
  • [32] Minimal loss reconfiguration based on simulated annealing meta-heuristic
    Santander, LG
    Chacra, FA
    Opazo, H
    Lopez, E
    15TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND COMPUTERS, PROCEEDINGS, 2005, : 95 - 99
  • [33] A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems
    Marcus Randall
    David Abramson
    Computational Optimization and Applications, 2001, 20 : 185 - 210
  • [34] A meta-heuristic algorithm for set covering problem based on gravity
    Raja Balachandar, S.
    Kannan, K.
    World Academy of Science, Engineering and Technology, 2010, 67 : 502 - 507
  • [35] A meta-heuristic algorithm for set covering problem based on gravity
    Raja Balachandar, S.
    Kannan, K.
    International Journal of Computational and Mathematical Sciences, 2010, 4 (05): : 223 - 228
  • [36] A lower bound based meta-heuristic for the vehicle routing problem
    Brandao, J
    ESSAYS AND SURVEYS IN METAHEURISTICS, 2002, 15 : 151 - 168
  • [37] Meta-Heuristic Algorithms Based Multi-Level Thresholding
    Kucukugurlu, Busranur
    Gedikli, Eyup
    2019 27TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2019,
  • [38] A META-HEURISTIC APPROACH FOR IPPS PROBLEM
    Alcan, Pelin
    Uslu, Mehmet Fatih
    Basligil, Huseyin
    UNCERTAINTY MODELLING IN KNOWLEDGE ENGINEERING AND DECISION MAKING, 2016, 10 : 778 - 784
  • [39] A review of feature selection methods based on meta-heuristic algorithms
    Sadeghian, Zohre
    Akbari, Ebrahim
    Nematzadeh, Hossein
    Motameni, Homayun
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2025, 37 (01) : 1 - 51
  • [40] Performance Comparison of Physics Based Meta-Heuristic Optimization Algorithms
    Demirol, Doygun
    Oztemiz, Furkan
    Karci, Ali
    2018 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND DATA PROCESSING (IDAP), 2018,