The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Single‐ended transition state finding with the growing string method
Abstract
Reaction path finding and transition state (TS) searching are important tasks in computational chemistry. Methods that seek to optimize an evenly distributed set of structures to represent a chemical reaction path are known as double‐ended string methods. Such methods can be highly reliable because the endpoints of the string are fixed, which effectively lowers the dimensionality of the reaction path search. String methods, however, require that the reactant and product structures are known beforehand, which limits their ability for systematic exploration of reactive steps. In this article, a single‐ended growing string method (GSM) is introduced which allows for reaction path searches starting from a single structure. The method works by sequentially adding nodes along coordinates that drive bonds, angles, and/or torsions to a desired reactive outcome. After the string is grown and an approximate reaction path through the TS is found, string optimization commences and the exact TS is located along with the reaction path. Fast convergence of the string is achieved through use of internal coordinates and eigenvector optimization schemes combined with Hessian estimates. Comparison to the double‐ended GSM shows that single‐ended method can be even more computationally efficient than the already rapid double‐ended method. Examples, including transition metal reactivity and a systematic, automated search for unknown reactivity, demonstrate the efficacy of the new method. This automated reaction search is able to find 165 reaction paths from 333 searches for the reaction of NH 3 BH 3 and (LiH)4, all without guidance from user intuition. © 2015 Wiley Periodicals, Inc.
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
VMD: visual molecular dynamics
Humphrey, W., Dalke, A., & Schulten, K. (1996) · Journal of Molecular Graphics · doi:10.1016/0263-7855(96)00018-5 · Cited by 66,952
Laio, A., & Parrinello, M. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.202427399 · Cited by 5,626
Cited by
Best‐Practice DFT Protocols for Basic Molecular Computational Chemistry**
Bursch, M., Mewes, J., Hansen, A., & Grimme, S. (2022) · Angewandte Chemie International Edition · doi:10.1002/anie.202205735 · Cited by 890
Machine learning for heterogeneous catalyst design and discovery
Goldsmith, B. R., Esterhuizen, J., Liu, J., Bartel, C. J., & Sutton, C. (2018) · AIChE Journal · doi:10.1002/aic.16198 · Cited by 444
Machine learning: Accelerating materials development for energy storage and conversion
Chen, A., Zhang, X., & Zhou, Z. (2020) · InfoMat · doi:10.1002/inf2.12094 · Cited by 370
Machine Learning for Computational Heterogeneous Catalysis
Schlexer Lamoureux, P., Winther, K. T., Garrido Torres, J. A., Streibel, V., Zhao, M., Bajdich, M., Abild‐Pedersen, F., & Bligaard, T. (2019) · ChemCatChem · doi:10.1002/cctc.201900595 · Cited by 356
Best‐Practice DFT Protocols for Basic Molecular Computational Chemistry**
Bursch, M., Mewes, J., Hansen, A., & Grimme, S. (2022) · Angewandte Chemie · doi:10.1002/ange.202205735 · Cited by 309
Metadata
- Authors
- Zimmerman, P. M.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 2015-01-08
- Volume
- 36
- Issue
- 9
- Pages
- 601-611
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2158177761
- Cited by
- 249
- References
- 2
- FWCI
- 9.17
- 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.