Stochastic protein folding simulation in the three-dimensional HP-model

DOI10.1016/J.COMPBIOLCHEM.2008.03.004zbMath1159.92016OpenAlexW2012217649WikidataQ51878889 ScholiaQ51878889MaRDI QIDQ1004918

K. Steinhöfel, A. Skaliotis, Andreas A. Albrecht

Publication date: 12 March 2009

Published in: Computational Biology and Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2008.03.004

zbMATH Keywords

simulated annealingstochastic local searchlandscape analysisHP-model

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Related Items (3)

Population-based local search for protein folding simulation in the MJ energy model and cubic lattices ⋮ Analysis of local search landscapes for \(k\)-SAT instances ⋮ Stochastic protein folding simulation in the three-dimensional HP-model

Uses Software

• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamics of proteins: Fast folders and sharp transitions
• A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Hydrophobic collapse in (in silico) protein folding
• A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)
• Stochastic protein folding simulation in the three-dimensional HP-model
• Rough large deviation estimates for simulated annealing: Application to exponential schedules
• A limit theorem for a class of inhomogeneous Markov processes
• Simulated annealing with time-dependent energy function via Sobolev inequalities
• Protein conformation of a lattice model using tabu search
• Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
• On the convergence of generalized hill climbing algorithms
• Approximate protein folding in the HP side chain model on extended cubic lattices
• Long proteins with unique optimal foldings in the H-P model
• Sufficient and necessary condition for the convergence of stochastic approximation algorithms
• A proof of the Kepler conjecture
• A stopping criterion for logarithmic simulated annealing
• Combinatorial Landscapes
• Efficiency of Local Search with Multiple Local Optima
• Opportunities for Combinatorial Optimization in Computational Biology
• Cooling Schedules for Optimal Annealing
• Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
• Equation of State Calculations by Fast Computing Machines
• Automata, Languages and Programming
• On the complexity of string folding

This page was built for publication: Stochastic protein folding simulation in the three-dimensional HP-model