The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A growing string method for determining transition states: Comparison to the nudged elastic band and string methods
Abstract
Interpolation methods such as the nudged elastic band and string methods are widely used for calculating minimum energy pathways and transition states for chemical reactions. Both methods require an initial guess for the reaction pathway. A poorly chosen initial guess can cause slow convergence, convergence to an incorrect pathway, or even failed electronic structure force calculations along the guessed pathway. This paper presents a growing string method that can find minimum energy pathways and transition states without the requirement of an initial guess for the pathway. The growing string begins as two string fragments, one associated with the reactants and the other with the products. Each string fragment is grown separately until the fragments converge. Once the two fragments join, the full string moves toward the minimum energy pathway according to the algorithm for the string method. This paper compares the growing string method to the string method and to the nudged elastic band method using the alanine dipeptide rearrangement as an example. In this example, for which the linearly interpolated guess is far from the minimum energy pathway, the growing string method finds the saddle point with significantly fewer electronic structure force calculations than the string method or the nudged elastic band method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Henkelman, G., & Jónsson, H. (2000) · The Journal of Chemical Physics · doi:10.1063/1.1323224 · Cited by 9,523
Introduction to Computational Chemistry
Jensen, F. (1998) · Cited by 4,669
Henkelman, G., & Jónsson, H. (1999) · The Journal of Chemical Physics · doi:10.1063/1.480097 · Cited by 3,481
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
An algorithm for the location of transition states
Baker, J. (1986) · Journal of Computational Chemistry · doi:10.1002/jcc.540070402 · Cited by 1,491
String method for the study of rare events
E, W., Ren, W., & Vanden-Eijnden, E. (2002) · Physical Review B · doi:10.1103/physrevb.66.052301 · Cited by 1,308
Mills, G., & Jónsson, H. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.1124 · Cited by 869
Search for stationary points on surfaces
Banerjee, A., Adams, N., Simons, J., & Shepard, R. (1985) · The Journal of Physical Chemistry · doi:10.1021/j100247a015 · Cited by 833
Improved algorithms for reaction path following: Higher-order implicit algorithms
Gonzalez, C., & Schlegel, H. B. (1991) · The Journal of Chemical Physics · doi:10.1063/1.461606 · Cited by 765
Cerjan, C. J., & Miller, W. H. (1981) · The Journal of Chemical Physics · doi:10.1063/1.442352 · Cited by 729
Cited by
Obtaining reaction coordinates by likelihood maximization
Peters, B., & Trout, B. L. (2006) · The Journal of Chemical Physics · doi:10.1063/1.2234477 · Cited by 417
Self-citationLin, Z., Kohn, A. W., & Van Voorhis, T. (2020) · The Journal of Physical Chemistry C · doi:10.1021/acs.jpcc.9b08292 · Cited by 78
Synergies Between Quantum Mechanics and Machine Learning in Reaction Prediction
Sadowski, P., Fooshee, D., Subrahmanya, N., & Baldi, P. (2016) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.6b00351 · Cited by 65
Karasawa, M., Leow, C. S., Yajima, H., Arai, S., Nishizaki, H., Terada, T., & Sato, H. (2025) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5c02398 · Cited by 9
Metadata
- Authors
- Peters, B., Heyden, A., Bell, A. T., & Chakraborty, A.
- Venue
- The Journal of Chemical Physics
- Publisher
- AIP Publishing
- Published
- 2004-05-01
- Volume
- 120
- Issue
- 17
- Pages
- 7877-7886
- ISSN
- 0021-9606 (ISSN-L)
- 1089-7690
- OpenAlex
- W2109455667
- Cited by
- 384
- References
- 27
- FWCI
- 7.58
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A growing string method for determining transition states: Comparison to the nudged elastic band and string methods. https://app.cochat.ai/papers/10.1063/1.1691018
- The paper
- Peters, B., Heyden, A., Bell, A. T., & Chakraborty, A. (2004). A growing string method for determining transition states: Comparison to the nudged elastic band and string methods. The Journal of Chemical Physics. https://doi.org/10.1063/1.1691018
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.