The GrΓΆbner Basis Algorithm is used to find closed form expressions for the generating functions of finite difference equations. Such difference equations arise in elliptic PDE's, random walk problems, and gambler's ruin problems.
Computational approach to the protein-folding problem
β Scribed by Jayanth R. Banavar; Amos Maritan
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 47 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0887-3585
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We, four independent predictors, organized a team and tackled blind protein structure predictions using fold recognition methods. We tried to assign the homologous or analogous folds in the protein structure database for a number of target sequences that showed no apparent sequence homology to the p
We have developed SPICKER, a simple and efficient strategy to identify near-native folds by clustering protein structures generated during computer simulations. In general, the most populated clusters tend to be closer to the native conformation than the lowest energy structures. To assess the gener
Three-dimensional (3D) models of four CASP3 targets were calculated using a simple modeling procedure that includes prediction of regular secondary structure, analysis of possible β€-sheet topologies, assembly of amphiphilic helices and β€-sheets to bury their nonpolar surfaces, and adjustment of side
We numerically compare the effectiveness of three recently proposed algorithms, multicanonical algorithm, simulations in a 1rk-sampling, and simulated tempering, for the protein folding problem. We perform simulations with high statistics for one of the simplest peptides, met-enkephalin. While the p