OOIR: Observatory of International Research

Papers

(The TQCC of Natural Computing is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-10-01 to 2025-10-01.)

Article	Citations
Verification and computation in restricted Tile Automata	53
An analysis of the relative effects of connectivity and coupling interactions on spin networks emulating the D-Wave 2000Q quantum annealer	31
Computational complexity and pragmatic solutions for flexible tile based DNA self-assembly	15
Precise makespan optimization via hybrid genetic algorithm for scientific workflow scheduling problem	14
Correction: Distinguishing genelet circuit input pulses via a pulse detector	11
Inductive inference of lindenmayer systems: algorithms and computational complexity	10
Gravitationally invariant subspaces in quantum computing	10
Spiking neural P systems: main ideas and results	9
Population-induced phase transitions and the verification of chemical reaction networks	9
Solitaire of independence	8
Preface	8
Spiking neural P systems and their semantics in Haskell	8
A formalization of co-transcriptional splicing as an operation on formal languages	8
Associating parallel automata network dynamics and strictly one-way cellular automata	8
The structural power of reconfigurable circuits in the amoebot model	8
Preface	8
Simulating and validating virus machines	8
Palindromes in adjacent factor swap of a word	7
Variants of string assembling systems	7
Cellular automata and Kan extensions	7
Modernizing quantum annealing II: genetic algorithms with the inference primitive formalism	6
Pure reaction automata	6
Koopman-based data-driven soft artificial life: obtaining rulesets from observed data	5
Turning machines: a simple algorithmic model for molecular robotics	5
Preface	5

Modelling and evaluating restricted ESNs on single- and multi-timescale problems	5
GPU simulations of spiking neural P systems on modern web browsers	5
A membrane computing approach to the generalized Nash equilibrium	4
On the spectrum between reaction systems and string rewriting	4
On the computational power of swarm automata using agents with position information	4
A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher	4
Evolving ensembles of heuristics for the travelling salesman problem	4
The busy beaver game for reaction systems	4
Generalized marked systems	4
Reaction systems with self distinction	4
Deep learning networks with rough-refinement optimization for food quality assessment	3
ALCH: An imperative language for chemical reaction network-controlled tile assembly	3
Algorithms for maximal existential and universal width	3
Reaction mining for reaction systems	3
Ranks of functions specified by minimal reaction systems and induced by images of singletons	3
Proving new directed tile complexity lower bounds at temperature 1 by folding between 2D and just-barely 3D self-assembly	3
All optical half adder and subtractor using single 2D photonic crystal structure	3
Editorial for the special issue on DNA computing and molecular programming	3
A roadmap for solving optimization problems with estimation of distribution algorithms	3
A survey on learning models of spiking neural membrane systems	3
CA-NN: a cellular automata neural network for handwritten pattern recognition	3
MRT-lattice Boltzmann hybrid model for the double diffusive mixed convection with thermodiffusion effect	3
Synchronization of elementary cellular automata	3
An exploration of reversible septenary number-conserving cellular automata: a survey of known methods	3
Preface	3
Cellular automata simulations of the sintering behavior of ceramics driven by surface energy reduction	3
Pure and mixed lexicographic-paretian many-objective optimization: state of the art	3
Programmable single-stranded architectures for computing	3
On categorical approach to reaction systems	3
Reaction systems with nondeterministic behaviour	3
Networks of splicing processors: path graph topology simulation	3