Premium
Algorithm to test the structural plausibility of a proposed elementary reaction
Author(s) -
ValdésPérez Raúal E.
Publication year - 1993
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/jcc.540141207
Subject(s) - covalent bond , computer science , algorithm , stoichiometry , filter (signal processing) , chemistry , organic chemistry , computer vision
Abstract An algorithm is introduced that tests whether a proposed elementary reaction can be realized within a specified number of cleavages and formations of covalent bonds. This is related to the problem of computing the minimum chemical distance of a given stoichiometry, but differs from it in important ways that are exploited in the algorithm design. One application of the algorithm is as a filter in MECHEM—a computer aid for the elucidation of reaction pathways. In that application, reaction steps implying more changes to covalent bonds than a given threshold are ruled implausible, and in practice such tests need to be carried out many thousands of times. Future applications of the algorithm can be expected because the question addressed is a fundamental one: What elementary reactions can occur? © 1993 by John Wiley & Sons, Inc.