Discovery of pathways in protein-protein interaction networks using a genetic algorithm

被引:5
作者
Hoai Anh Nguyen [1 ]
Cong Long Vu [1 ]
Minh Phuong Tu [2 ]
Thu Lam Bui [1 ]
机构
[1] Le Quy Don Tech Univ, Fac Informat Technol, Hanoi, Vietnam
[2] Posts & Telecommun Inst Technol, Dept Comp Sci, Hanoi, Vietnam
关键词
Genetic algorithms; Protein; Interaction; Network; REGULATORY NETWORKS; PHEROMONE RESPONSE; RECONSTRUCTION; YEAST;
D O I
10.1016/j.datak.2015.04.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Biological pathways have played an important role in understanding cell activities and evolution. In order to find these pathways, it is necessary to orient protein-protein interactions, which are usually given in forms of undirected networks or graphs. Previous findings indicate that orienting protein interactions can improve the process of pathway discovery. However, assigning orientation for protein interactions is a combinatorial optimization problem which has been proved to be NP-hard, making it critical to develop efficient algorithms. This paper proposes a method for orienting protein-protein interaction networks (PPIs) and discovering pathways. For our proposal, the mathematical model of the problem is given and then a genetic algorithm is designed to find the solution for the problem taking into account the problem's characteristics. We conducted multiple runs on the data of yeast PPI networks to test the best option for the problem. The obtained results were compared with a well-known algorithm (ROLS), which was shown to be the best in dealing with this problem, in terms of the run time, fitness function values, and especially the ratio of matching gold standard pathways. The results show the good performance of our approach in addressing this problem. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:19 / 31
页数:13
相关论文
共 37 条
[1]  
Anh N.H., 2013, P SOCPAR201 IN PRESS
[2]  
[Anonymous], EVOLUTIONARY COMPUTA
[3]   Structure of morphologically expanded queries: A genetic algorithm approach [J].
Araujo, Lourdes ;
Zaragoza, Hugo ;
Perez-Aguera, Jose R. ;
Perez-Iglesias, Joaquin .
DATA & KNOWLEDGE ENGINEERING, 2010, 69 (03) :279-289
[4]  
Back T., 1996, Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms
[5]   A walk-through of the yeast mating pheromone response pathway [J].
Bardwell, L .
PEPTIDES, 2004, 25 (09) :1465-1476
[6]   PathFinder: mining signal transduction pathway segments from protein-protein interaction networks [J].
Bebek, Gurkan ;
Yang, Jiong .
BMC BIOINFORMATICS, 2007, 8 (1)
[7]  
Blokh Dima, 2012, Combinatorial Pattern Matching. Proceedings 23rd Annual Symposium, CPM 2012, P70, DOI 10.1007/978-3-642-31265-6_6
[8]   Genetic algorithms for approximate similarity queries [J].
Bueno, Renato ;
Traina, Agma J. M. ;
Traina, Caetano, Jr. .
DATA & KNOWLEDGE ENGINEERING, 2007, 62 (03) :459-482
[9]   Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems [J].
Charikar, Moses ;
Makarychev, Konstantin ;
Makarychev, Yury .
ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (03)
[10]   Genetically constrained metabolic flux analysis [J].
Cox, SJ ;
Levanon, SS ;
Bennett, GN ;
San, KY .
METABOLIC ENGINEERING, 2005, 7 (5-6) :445-456