Gene selection using pyramid gravitational search algorithm.

Autor: Tahmouresi A; Faculty of Medicine, Kerman University of Medical Sciences, Kerman, Iran., Rashedi E; Department of Electrical and Computer Engineering, Graduate University of Advanced Technology, Kerman, Iran., Yaghoobi MM; Department of Biotechnology, Institute of Science and High Technology and Environmental Sciences, Graduate University of Advanced Technology, Kerman, Iran., Rezaei M; Faculty of Medicine, Kerman University of Medical Sciences, Kerman, Iran.
Jazyk: angličtina
Zdroj: PloS one [PLoS One] 2022 Mar 15; Vol. 17 (3), pp. e0265351. Date of Electronic Publication: 2022 Mar 15 (Print Publication: 2022).
DOI: 10.1371/journal.pone.0265351
Abstrakt: Genetics play a prominent role in the development and progression of malignant neoplasms. Identification of the relevant genes is a high-dimensional data processing problem. Pyramid gravitational search algorithm (PGSA), a hybrid method in which the number of genes is cyclically reduced is proposed to conquer the curse of dimensionality. PGSA consists of two elements, a filter and a wrapper method (inspired by the gravitational search algorithm) which iterates through cycles. The genes selected in each cycle are passed on to the subsequent cycles to further reduce the dimension. PGSA tries to maximize the classification accuracy using the most informative genes while reducing the number of genes. Results are reported on a multi-class microarray gene expression dataset for breast cancer. Several feature selection algorithms have been implemented to have a fair comparison. The PGSA ranked first in terms of accuracy (84.5%) with 73 genes. To check if the selected genes are meaningful in terms of patient's survival and response to therapy, protein-protein interaction network analysis has been applied on the genes. An interesting pattern was emerged when examining the genetic network. HSP90AA1, PTK2 and SRC genes were amongst the top-rated bottleneck genes, and DNA damage, cell adhesion and migration pathways are highly enriched in the network.
Competing Interests: The authors have declared that no competing interests exist.
Databáze: MEDLINE
Externí odkaz:
Nepřihlášeným uživatelům se plný text nezobrazuje