Gene Ranking: A Novel Approach Using Multi-Objective Genetic Algorithm

被引:0
作者
Das, Priyojit [1 ]
Saha, Sujay [2 ]
Ghosh, Anupam [3 ]
Dey, Kashi Nath [4 ]
机构
[1] Natl Inst Technol Calicut, Dept Comp Sci & Engn, Kozhikode 673601, Kerala, India
[2] Heritage Inst Technol, Dept Comp Sci & Engn, Kolkata 700107, W Bengal, India
[3] Netaji Subhas Engn Coll, Dept Comp Sci & Engn, Kolkata 700152, W Bengal, India
[4] Univ Calcutta, Dept Comp Sci & Engn, Kolkata 700009, W Bengal, India
来源
2018 7TH INTERNATIONAL CONFERENCE ON RELIABILITY, INFOCOM TECHNOLOGIES AND OPTIMIZATION (TRENDS AND FUTURE DIRECTIONS) (ICRITO) (ICRITO) | 2018年
关键词
Microarray; Gene Expression Data; Genetic Algorithm; Multi-objective Genetic Algorithm; PageRank; HITS; EXPRESSION; CANCER; MICROARRAY; DISCOVERY; NETWORK;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In a Gene Co-expression Network, the same or closely related genes are clustered into co-expressed groups. It is necessary to investigate the role that these genes play as far as some complex diseases like cancer are concerned in those networks. Ranking those genes actually discover the significant candidate genes for various types of cancers. There are several gene ranking algorithms proposed so far that produces the top ranked genes according to their importance with respect to a particular cancer disease. In this work, we apply multi-objective genetic algorithm, Multi-Objective Network GA, on a gene coexpression network to find the top ranked cancer mediating genes. The algorithm is applied to publicly available real-life cancer datasets taken from NCBI (National Centre for Biotechnology Information) biological online repository. The performance of the algorithm is justified by classification using SVM classifier with linear kernel and it is compared with state-of-the-art methods on the basis of percentage of accuracy, precision, recall, and F1-Score.
引用
收藏
页码:523 / 528
页数:6
相关论文
共 27 条
  • [1] [Anonymous], 2001, An Introduction to Genetic Algorithms. Complex Adaptive Systems
  • [2] Identification of the Transcription Factor Single-Minded Homologue 2 as a Potential Biomarker and Immunotherapy Target in Prostate Cancer
    Arredouani, Mohamed S.
    Lu, Bin
    Bhasin, Manoj
    Eljanne, Miriam
    Yue, Wen
    Mosquera, Juan-Miguel
    Bubley, Glenn J.
    Li, Vivian
    Rubin, Mark A.
    Libermann, Towia A.
    Sanda, Martin G.
    [J]. CLINICAL CANCER RESEARCH, 2009, 15 (18) : 5794 - 5802
  • [3] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [4] Systematic Identification of Cell-Wall Related Genes in Populus Based on Analysis of Functional Modules in Co-Expression Network
    Cai, Bin
    Li, Cheng-Hui
    Huang, Jian
    [J]. PLOS ONE, 2014, 9 (04):
  • [5] Microarray enriched gene rank
    Demidenko, Eugene
    [J]. BIODATA MINING, 2015, 8
  • [6] Gene Expression Omnibus: NCBI gene expression and hybridization array data repository
    Edgar, R
    Domrachev, M
    Lash, AE
    [J]. NUCLEIC ACIDS RESEARCH, 2002, 30 (01) : 207 - 210
  • [7] Fuzzy Correlated Association Mining: Selecting altered associations among the genes, and some possible marker genes mediating certain cancers
    Ghosh, Anupam
    De, Rajat K.
    [J]. APPLIED SOFT COMPUTING, 2016, 38 : 587 - 605
  • [8] Selection of genes mediating certain cancers, using a neuro-fuzzy approach
    Ghosh, Anupam
    Dhara, Bibhas Chandra
    De, Rajat K.
    [J]. NEUROCOMPUTING, 2014, 133 : 122 - 140
  • [9] Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring
    Golub, TR
    Slonim, DK
    Tamayo, P
    Huard, C
    Gaasenbeek, M
    Mesirov, JP
    Coller, H
    Loh, ML
    Downing, JR
    Caligiuri, MA
    Bloomfield, CD
    Lander, ES
    [J]. SCIENCE, 1999, 286 (5439) : 531 - 537
  • [10] Molecular network analysis enhances understanding of the biology of mental disorders
    Grennan, Kay S.
    Chen, Chao
    Gershon, Elliot S.
    Liu, Chunyu
    [J]. BIOESSAYS, 2014, 36 (06) : 606 - 616