Lam C F, Priest D G
Biophys J. 1972 Mar;12(3):248-56. doi: 10.1016/S0006-3495(72)86084-3.
One of the most generally applicable algorithms for the derivation of steady-state rate equations for complex enzyme reaction mechanisms is that of King and Altman. Several modifications of this algorithm have been suggested; however, each requires the generation of numerous valid and invalid patterns and the subsequent elimination of those that are invalid. A method is presented, employing topological theory of linear graphs, for the systematic generation of only those patterns which are valid. This method is readily adaptable to use on a digital computer. An independent method for the calculation of the number of valid patterns is also presented. This calculation can be used to substantiate the accuracy of the patterns obtained. This calculation is also adaptable to computerization. Examples are included to demonstrate both the generation of patterns and the calculation of their number for specific enzyme mechanisms.
推导复杂酶反应机制稳态速率方程最普遍适用的算法之一是金和奥特曼算法。人们已提出了对该算法的若干改进；然而，每种改进都需要生成大量有效和无效模式，随后还要剔除那些无效模式。本文提出一种方法，利用线性图的拓扑理论，仅系统地生成有效模式。该方法很容易适用于数字计算机。还提出了一种计算有效模式数量的独立方法。这种计算可用于证实所获得模式的准确性。这种计算也适用于计算机化。文中给出了示例，以展示特定酶机制模式的生成及其数量的计算。
