CPSP-tools – Exact and complete algorithms for high-throughput 3D lattice protein studies
Open Access
- 7 May 2008
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 9 (1) , 230
Abstract
The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. lattice proteins. The CPSP-tools package provides programs to solve exactly and completely the problems typical of studies using 3D lattice protein models. Among the tasks addressed are the prediction of (all) globally optimal and/or suboptimal structures as well as sequence design and neutral network exploration.Keywords
This publication has 30 references indexed in Scilit:
- A tale of two tails: why are terminal residues of proteins exposed?Bioinformatics, 2007
- Modelling sequential protein folding under kinetic controlBioinformatics, 2006
- Exploring the lower part of discrete polymer model energy landscapesEurophysics Letters, 2006
- A Constraint-Based Approach to Fast and Exact Structure Prediction in Three-Dimensional Protein ModelsConstraints, 2006
- Classification of microarray data with factor mixture modelsBioinformatics, 2005
- Growth-based optimization algorithm for lattice heteropolymersPhysical Review E, 2003
- Networks in molecular evolutionComplexity, 2002
- Residue coordination in proteins conforms to the closest packing of spheresPolymer, 2002
- The complexity and accuracy of discrete state models of protein structureJournal of Molecular Biology, 1995
- Modeling the effects of mutations on the denatured states of proteinsProtein Science, 1992