Reaction systems, a formalism describing biochemical reactions in terms of sets of reactants, inhibitors, and products, are known to have a PSPACE-complete configuration reachability problem. We show that the complexity of the problem remains unchanged even for some classes of resource-bounded reaction systems, where we disallow either inhibitors or reactants. We also prove that the complexity decreases to NP in the specific case of inhibitorless reaction systems using only one reactant per reaction.
Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A. (2016). Reachability in resource-bounded reaction systems. In Language and Automata Theory and Applications (pp.592-602). Springer Verlag [10.1007/978-3-319-30000-9_45].
Reachability in resource-bounded reaction systems
DENNUNZIO, ALBERTOPrimo
;MANZONI, LUCAPenultimo
;PORRECA, ANTONIO ENRICO
2016
Abstract
Reaction systems, a formalism describing biochemical reactions in terms of sets of reactants, inhibitors, and products, are known to have a PSPACE-complete configuration reachability problem. We show that the complexity of the problem remains unchanged even for some classes of resource-bounded reaction systems, where we disallow either inhibitors or reactants. We also prove that the complexity decreases to NP in the specific case of inhibitorless reaction systems using only one reactant per reaction.
| File | Dimensione | Formato | |
|---|---|---|---|
|
Paper.pdf
accesso aperto
Descrizione: Preprint
Dimensione
390.25 kB
Formato
Adobe PDF
|
390.25 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
