Biological complexity: ant colony meta-heuristic optimization algorithm for protein folding

被引:7
|
作者
Kaushik, Aman Chandra [1 ]
Sahi, Shakti [1 ]
机构
[1] Gautam Buddha Univ, Sch Biotechnol, Greater Noida, Uttar Pradesh, India
来源
NEURAL COMPUTING & APPLICATIONS | 2017年 / 28卷 / 11期
关键词
ACO; Node; Heuristics; Pheromones; NP hard problems; GAFF; MONTE-CARLO ALGORITHM; MODEL PROTEINS; COOPERATIVITY; TRANSITIONS; STATE;
D O I
10.1007/s00521-016-2252-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ant colony meta-heuristic optimization (ACO) is one of the few algorithms that can help to gain an atomic level insight into the conformation of protein folding states, intermediate weights and pheromones present along the protein folding pathway. These are analysed by nodes (amino acids), and these nodes depend upon the probability of next optimized node (amino acids). Nodes have conformational degrees of freedom as well as depend upon the natural factors and collective behaviour of biologically important molecules like temperature, volume, pressure and other ensembles. This biological quantum complexity can be resolved using ACO algorithm. Ants are visually blind and important behaviour of communication among individuals or colony of ant environment is based on chemicals (pheromones) deposited by the ants. Just like ants, proteins are also a group of colony; amino acids are node (amino acid) attached to each others with the help of bonds. This paper is aimed to determine the factors affecting protein folding pattern using ant colony algorithm. Protein occurs structurally in a compact form and determining the ways of protein folding is called NP hard (non-deterministic polynomial-time hard) problem. Using the ACO, we have developed an algorithm for protein folding. It is interesting to note that based on ants ability to find new shorter path between the nest and the food, proteins can also be optimized for shorter path between one node to another node and the folding pattern can be predicted for an unknown protein (ab initio). We have developed an application based on ACO in Perl language (PFEBRT) for determining optimized folding path of proteins.
引用
收藏
页码:3385 / 3391
页数:7
相关论文
共 50 条
  • [1] Biological complexity: ant colony meta-heuristic optimization algorithm for protein folding
    Aman Chandra Kaushik
    Shakti Sahi
    [J]. Neural Computing and Applications, 2017, 28 : 3385 - 3391
  • [2] Ant Colony Optimization Meta-Heuristic in Project Scheduling
    Olteanu, Alexandru-Liviu
    [J]. PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, KNOWLEDGE ENGINEERING AND DATA BASES, 2009, : 29 - +
  • [3] A Meta-heuristic with Ant Colony Approach to Complex System
    Liu, Zongli
    Cao, Jie
    Yuan, Zhanting
    [J]. ADVANCED MECHANICAL ENGINEERING, PTS 1 AND 2, 2010, 26-28 : 1147 - 1150
  • [4] Meta-Heuristic Ant Colony Algorithm for Multi-Tasking Assignment on Collaborative AUVs
    Li, Jian Jun
    Zhang, Ru Bo
    Yang, Yu
    [J]. INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2015, 8 (03): : 135 - 143
  • [5] Meta-heuristic Ant Colony Optimization Based Unequal Clustering for Wireless Sensor Network
    Guleria, Kalpna
    Verma, Anil Kumar
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2019, 105 (03) : 891 - 911
  • [6] Counter-based ant colony optimization as a hardware-oriented meta-heuristic
    Scheuermann, B
    Middendorf, M
    [J]. APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2005, 3449 : 235 - 244
  • [7] Meta-heuristic Ant Colony Optimization Based Unequal Clustering for Wireless Sensor Network
    Kalpna Guleria
    Anil Kumar Verma
    [J]. Wireless Personal Communications, 2019, 105 : 891 - 911
  • [8] Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm, Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem
    Alejandro, Fuentes-Penna
    Marisa, Estrada-Carrillo
    Ivette, Flores-Jimenez
    Ruth, Flores-Jimenez
    Moreno-Gutierrez Silvia, S.
    [J]. INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2014, 5 (03): : 2 - 15
  • [9] Playground Algorithm as a New Meta-heuristic Optimization Algorithm
    Altwlkany, Kemal
    Konjicija, Samim
    [J]. 2019 XXVII INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND AUTOMATION TECHNOLOGIES (ICAT 2019), 2019,
  • [10] Buyer Inspired Meta-Heuristic Optimization Algorithm
    Debnath, Sanjoy
    Arif, Wasim
    Baishya, Srimanta
    [J]. OPEN COMPUTER SCIENCE, 2020, 10 (01) : 194 - 219