Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network
Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. For a s...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| اللغة: | English |
| منشور في: |
2017
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://eprints.usm.my/42907/1/JAMALUDIN__SALLIM.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. For a small PPI data size, ACO has been successfully applied to but it is not suitable for large and noisy PPI data, which has caused to premature convergence and stagnation in the searching process. To cope with the aforementioned limitations, we propose two new enhancements of ACO to solve PFMD problem. |
|---|