An efficient approach for solving the HP protein folding problem based on UEGO

DOI10.1007/s10910-014-0459-1zbMath1331.92119OpenAlexW2024618218WikidataQ57275089 ScholiaQ57275089MaRDI QIDQ2353544

J. M. García-Martínez, H. Pérez-Sánchez, E. M. Garzón, Pilar M. Ortigosa, José M. Cecilia

Publication date: 15 July 2015

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-014-0459-1

zbMATH Keywords

evolutionary algorithmprotein foldingmultiscale modelingHP modelalgorithm acceleration

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Lattice conformation of theta-curves accompanied with Brunnian property

Uses Software

• UEGO
• PyMOL

Cites Work

• Protein structure prediction using distributed parallel particle swarm optimization
• Peptide structure prediction using distributed volunteer computing networks
• A constraint-based approach to fast and exact structure prediction in three-dimensional protein models
• A robust and efficient algorithm for planar competitive location problems
• A population global optimization algorithm to solve the image alignment problem in electron crystallography
• A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand
• An approach for solving competitive location problems with variable demand using multicore systems
• Parallel algorithms for continuous competitive location problems
• Reliability and performance of UEGO, a clustering-based global optimizer
• UEGO, an abstract clustering technique for multimodal global optimization

This page was built for publication: An efficient approach for solving the HP protein folding problem based on UEGO