Szlobodnyik, Gergely and Szederkényi, Gábor (2025) Polynomial Time Reachable Sequence Computation in Discrete State Reaction Networks. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 95 (3). pp. 565-587. ISSN 0340-6253 10.46793/match.95-3.29125

Text Szlobodnyik_565_36455158_z.pdf Restricted to Registered users only Request a copy

Abstract

In this paper a computationally efficient solution is proposed for the reachable sequence computation problem in the context of sub and superconservative discrete state Chemical Reaction Network (CRN) subclasses. It is shown that a minimal-length reachable state transition sequence and reaction vector sequence can be determined in polynomial time, assuming that the reachability relation holds. A constructive proof is provided in which a computational procedure is composed to find a reachable state transition sequence, provided a pair of initial and target states. In the studied subclasses of discrete state CRNs it is known that the reachability problem - as a decision problem - can be decided in polynomial time by solving a Linear Program formulated by means of the CRN state equation. Leveraging the LP relaxation, the constructed procedure formulates the computational problem of feasible sequence calculation by iteratively solving Linear Programs related to the decision problem of CRN reachability.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Systems and Control Lab
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	22 Jan 2026 10:47
Last Modified:	22 Jan 2026 10:47
URI:	https://eprints.sztaki.hu/id/eprint/11079

Update Item