The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
Abstract
This paper discusses the mathematical formulation of and solution attempts for the so-called protein folding problem. The static aspect is concerned with how to predict the folded (native, tertiary) structure of a protein given its sequence of amino acids. The dynamic aspect asks about the possible pathways to folding and unfolding, including the stability of the folded protein. From a mathematical point of view, there are several main sides to the static problem: -- the selection of an appropriate potential energy function; -- the parameter identification by fitting to experimental data; and -- the global optimization of the potential. The dynamic problem entails, in addition, the solution of (because of multiple time scales very stiff) ordinary or stochastic differential equations (molecular dynamics simulation) or (in case of constrained molecular dynamics) of differential-algebraic equations. A theme connecting the static and dynamic aspect is the determination and formation of secondary structure motifs. The present paper gives a self-contained introduction to the necessary background from physics and chemistry and surveys some of the literature. It also discusses the various mathematical problems arising, some deficiencies of the current models and algorithms, and possible (past and future) attacks to arrive at solutions to the protein-folding problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Computer Simulation of Liquids
Allen, M. P., & Tildesley, D. J. (2017) · doi:10.1093/oso/9780198803195.001.0001 · Cited by 20,945
Reaction-rate theory: fifty years after Kramers
Hänggi, P., Talkner, P., & Borkovec, M. (1990) · Reviews of Modern Physics · doi:10.1103/revmodphys.62.251 · Cited by 6,154 · cited 1×
“A complete review of the subject from the classical and the quantum point of view is given by Hänggi et al. [125].”
BackgroundA discussion of the solution for the best rotation to relate two sets of vectors
Kabsch, W. (1978) · Acta Crystallographica Section A · doi:10.1107/s0567739478001680 · Cited by 1,151 · cited 1×
“The related problem of finding the optimal superposition of two geometries for a molecule is discussed in Kabsch [160].”
BackgroundToward an outline of the topography of a realistic protein-folding funnel.
Onuchic, J. N., Wolynes, P. G., Luthey-Schulten, Z., & Socci, N. D. (1995) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.92.8.3626 · Cited by 523
The nature of folded states of globular proteins
Honeycutt, J. D., & Thirumalai, D. (1992) · Biopolymers · doi:10.1002/bip.360320610 · Cited by 360 · cited 4×
“As in earlier models (e.g., Honeycutt & Thirumalai [146]), the amino acids are treated in a reduced descriprion only, based on their hydrophilic or hydrophobic affinity.”
BackgroundInfluentialTopology fingerprint approach to the inverse protein folding problem
Godzik, A., Kolinski, A., & Skolnick, J. (1992) · Journal of Molecular Biology · doi:10.1016/0022-2836(92)90693-e · Cited by 339
De novo and inverse folding predictions of protein structure and dynamics
Godzik, A., Kolinski, A., & Skolnick, J. (1993) · Journal of Computer-Aided Molecular Design · doi:10.1007/bf02337559 · Cited by 91 · cited 3×
“In 1985, the limit was at only about 0.3 nanoseconds (Levy et al. [188]); now there are studies covering several nanoseconds (e.g., Tobias et al. [319], Guo et al [124], Soman et al. [301]) and, according to Godzik et al. [115], 100ns are feasible in a lattice approximatimation.”
BackgroundInfluential
Cited by
Evolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572
A comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
Complete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Acta Numerica · doi:10.1017/s0962492904000194 · Cited by 430
Self-citation
Metadata
- Authors
- Neumaier, A.
- Venue
- SIAM Review
- Published
- 1997-01
- Volume
- 39
- Issue
- 3
- Pages
- 407-460
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2039992864
- Cited by
- 175
- References
- 7
- FWCI
- 2.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.