2012
DOI: 10.1007/978-3-642-34062-8_58
|View full text |Cite
|
Sign up to set email alerts
|

Ant Colony Optimization with Multi-Agent Evolution for Detecting Functional Modules in Protein-Protein Interaction Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
3
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…throughput experimental technologies remain limited by their high cost and time-consuming application, developing effective and efficient computational approaches for detecting PFMs in PPINs has become an essential and challenging problem in computational biology [6]. A PPIN is a hierarchical and modular network, which can be typically represented by a connection graph, where the individual proteins and the interactions between proteins correspond to nodes and edges in the network, respectively [7].…”
Section: Plos Onementioning
confidence: 99%
“…throughput experimental technologies remain limited by their high cost and time-consuming application, developing effective and efficient computational approaches for detecting PFMs in PPINs has become an essential and challenging problem in computational biology [6]. A PPIN is a hierarchical and modular network, which can be typically represented by a connection graph, where the individual proteins and the interactions between proteins correspond to nodes and edges in the network, respectively [7].…”
Section: Plos Onementioning
confidence: 99%
“…However, this algorithm easily falls into the local optimum. In literature [26], a new ACO-MAE mechanism that combines ACO with the idea of multi-agent evolution (MAE) was developed to achieve better prediction accuracy.…”
Section: Existing Workmentioning
confidence: 99%
“…By taking the detection of functional modules as the optimization problem of solving Traveling Salesman Problem, ACOPIN adapts Ant Colony Optimization (ACO) algorithm into PPI network problems. In 2012, Ji et al proposed a new algorithm, which combines ant colony optimization with multi-agent evolution (ACO-MAE) to explore and exploit search spaces for detecting functional modules [13]. This algorithm has both the advantage of ACO, the ability to find feasible solutions by means of collaborations among ants, and that of MAE, the ability to further extend search subspaces and then to move out of local optima.…”
Section: Introductionmentioning
confidence: 99%