An efficient approach for solving the HP protein folding problem based on UEGO
From MaRDI portal
Publication:2353544
Recommendations
- 3D protein structure prediction
- Multiobjectivizing the HP model for protein structure prediction
- scientific article; zbMATH DE number 841183
- Protein folding in the HP model on grid lattices with diagonals (extended abstract)
- Protein folding simulations of 2D HP model by the genetic algorithm based on optimal secondary structures
Cites work
- A constraint-based approach to fast and exact structure prediction in three-dimensional protein models
- A population global optimization algorithm to solve the image alignment problem in electron crystallography
- A robust and efficient algorithm for planar competitive location problems
- 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
- Peptide structure prediction using distributed volunteer computing networks
- Protein structure prediction using distributed parallel particle swarm optimization
- Reliability and performance of UEGO, a clustering-based global optimizer
- UEGO, an abstract clustering technique for multimodal global optimization
Cited in
(2)
This page was built for publication: An efficient approach for solving the HP protein folding problem based on UEGO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353544)