The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Finding pathways between distant local minima
Open accessAbstract
We report a new algorithm for constructing pathways between local minima that involve a large number of intervening transition states on the potential energy surface. A significant improvement in efficiency has been achieved by changing the strategy for choosing successive pairs of local minima that serve as endpoints for the next search. We employ Dijkstra’s algorithm [E. W. Dijkstra, Numer. Math. 1, 269 (1959)] to identify the “shortest” path corresponding to missing connections within an evolving database of local minima and the transition states that connect them. The metric employed to determine the shortest missing connection is a function of the minimized Euclidean distance. We present applications to the formation of buckminsterfullerene and to the folding of various biomolecules: the B1 domain of protein G, tryptophan zippers, and the villin headpiece subdomain. The corresponding pathways contain up to 163 transition states and will be used in future discrete path sampling calculations.
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
T RANSITION P ATH S AMPLING : Throwing Ropes Over Rough Mountain Passes, in the Dark
Bolhuis, P. G., Chandler, D., Dellago, C., & Geissler, P. L. (2002) · Annual Review of Physical Chemistry · doi:10.1146/annurev.physchem.53.082301.113146 · Cited by 1,972
Cited by
Optimization methods for finding minimum energy paths
Sheppard, D., Terrell, R., & Henkelman, G. (2008) · The Journal of Chemical Physics · doi:10.1063/1.2841941 · Cited by 1,859
Piana, S., Laio, A., Marinelli, F., Van Troys, M., Bourry, D., Ampe, C., & Martins, J. C. (2008) · Journal of Molecular Biology · doi:10.1016/j.jmb.2007.10.020 · Cited by 48
Metadata
- Authors
- Carr, J. M., Trygubenko, S. A., & Wales, D. J.
- Venue
- The Journal of Chemical Physics
- Publisher
- AIP Publishing
- Published
- 2005-06-15
- Volume
- 122
- Issue
- 23
- Pages
- 234903-234903
- ISSN
- 0021-9606 (ISSN-L)
- 1089-7690
- OpenAlex
- W2066549314
- Cited by
- 176
- References
- 1
- FWCI
- 2.54
- Type
- journal article
- Language
- en
- Open access
- green
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.