摘要：Structural non-uniqueness of (bio) chemical reaction networks realizing a given kinetic dynamics has been known for a long time, but it is often overlooked in practice. However, without appropriate prior information, this phenomenon seriously hinders the successful identification of biochemical models. Recently an algorithm with guaranteed polynomial time complexity between iterations has been developed to compute all distinct reaction graph structures corresponding to a given dynamics. This paper presents an improved version of this algorithm that is suitable to take the advantage of a multiprocessor environment. The computed structures are collected in a task queue, and two server processes coordinate the operation of the set of workers. The implementation is briefly described and the performance of the approach is illustrated on computational examples taken from the literature.
