2 citations · 4 across the 5 of their papers we have counts for
6 papers
Small universal multiset reaction systems
Andrei Paun, Annemarie-Beatrix Messner
This paper presents a construction of a small universal machine within the framework of Multi-set Reaction Systems. We encode the machine state using elements that represent regist…
Jump Complexity of Deterministic Finite Automata with Translucent Letters
Szilárd Zsolt Fazekas, Victor Mitrana, Andrei Păun +1
We investigate a dynamical complexity measure defined for finite automata with translucent letters (FAwtl). Roughly, this measure counts the minimal number of necessary jumps for s…
Network analytics for drug repurposing in COVID-19
Nicoleta Siminea, Victor Popescu, Jose Angel Sanchez Martin +14
To better understand the potential of drug repurposing in COVID-19, we analyzed control strategies over essential host factors for SARS-CoV-2 infection. We constructed comprehensiv…
The Nondeterministic Waiting Time Algorithm: A Review
John Jack, Andrei Paun
We present briefly the Nondeterministic Waiting Time algorithm. Our technique for the simulation of biochemical reaction networks has the ability to mimic the Gillespie Algorithm f…
Modeling the effects of HIV-1 virions and proteins on Fas-induced apoptosis of infected cells
John Jack, Andrei Paun
We report a first in modeling and simulation of the effects of the HIV proteins on the (caspase dependent) apoptotic pathway in infected cells. This work is novel and is an extensi…
On the Hopcroft's minimization algorithm
Andrei Paun
We show that the absolute worst case time complexity for Hopcroft's minimization algorithm applied to unary languages is reached only for de Bruijn words. A previous paper by Berst…