Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 249

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

Zimmerman, Paul M.·2015·Journal of Computational Chemistry

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/jcc.23833

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 249

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.