Christie B D, Munk M E
Department of Chemistry, Arizona State University, Tempe 85287.
J Chem Inf Comput Sci. 1988 May;28(2):87-93. doi: 10.1021/ci00058a009.
A problem common to computer programs for structure elucidation is the efficient and prospective use of the input information to constrain the structure generation process. The input may consist of potentially overlapping substructure requirements and alternative substructure interpretations of spectral data. Other useful information may be structural features that must not be present in the output structures. All of these may interact in a complex manner that is impossible to determine by use of a bond-by-bond structure assembly algorithm. A new method is described called structure reduction. In contrast to structure assembly, this method begins with a set of all bonds and removes inconsistent bonds as structure generation progresses. This results in a more efficient use of the input information and the ability to use potentially overlapping required substructures. Several examples illustrate the application of our computer program COCOA, which uses this method to solve real-world structure elucidation problems.
用于结构解析的计算机程序普遍存在的一个问题是如何高效且前瞻性地利用输入信息来约束结构生成过程。输入信息可能包括潜在重叠的子结构要求以及光谱数据的替代子结构解释。其他有用信息可能是输出结构中不得出现的结构特征。所有这些信息可能以复杂的方式相互作用,而使用逐个键的结构组装算法无法确定这种相互作用。本文描述了一种称为结构约简的新方法。与结构组装不同,该方法从一组所有键开始,并在结构生成过程中去除不一致的键。这使得能够更有效地利用输入信息,并能够使用潜在重叠的所需子结构。几个例子说明了我们的计算机程序COCOA的应用,该程序使用此方法解决实际的结构解析问题。