A Hybrid Monte Carlo Ant Colony Optimization Approach for Protein Structure Prediction in the HP Model

09/30/2013
by   Andrea G. Citrolo, et al.
0

The hydrophobic-polar (HP) model has been widely studied in the field of protein structure prediction (PSP) both for theoretical purposes and as a benchmark for new optimization strategies. In this work we introduce a new heuristics based on Ant Colony Optimization (ACO) and Markov Chain Monte Carlo (MCMC) that we called Hybrid Monte Carlo Ant Colony Optimization (HMCACO). We describe this method and compare results obtained on well known HP instances in the 3 dimensional cubic lattice to those obtained with standard ACO and Simulated Annealing (SA). All methods were implemented using an unconstrained neighborhood and a modified objective function to prevent the creation of overlapping walks. Results show that our methods perform better than the other heuristics in all benchmark instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2019

Monte Carlo simulation on the Stiefel manifold via polar expansion

Motivated by applications to Bayesian inference for statistical models w...
research
12/03/2017

Simulated Annealing Algorithm for Graph Coloring

The goal of this Random Walks project is to code and experiment the Mark...
research
01/31/2022

Continual Repeated Annealed Flow Transport Monte Carlo

We propose Continual Repeated Annealed Flow Transport Monte Carlo (CRAFT...
research
09/10/2003

Using Simulated Annealing to Calculate the Trembles of Trembling Hand Perfection

Within the literature on non-cooperative game theory, there have been a ...
research
06/24/2011

Monte Carlo Methods for Tempo Tracking and Rhythm Quantization

We present a probabilistic generative model for timing deviations in exp...
research
05/26/2022

DRLComplex: Reconstruction of protein quaternary structures using deep reinforcement learning

Predicted inter-chain residue-residue contacts can be used to build the ...
research
01/06/2020

Clustering Binary Data by Application of Combinatorial Optimization Heuristics

We study clustering methods for binary data, first defining aggregation ...

Please sign up or login with your details

Forgot password? Click here to reset