Natural Computing: an international journal

Synthetic biology often takes cues from complex natural networks and pathways to create novel biological systems. The design modalities used in synthetic systems generally follow the different classes of gene regulation in cells such as transcriptional, ...

Cancer treatment is a fragmented and varied process, as "cancer" is really hundreds of different diseases. The "hallmarks of cancer" proposed by Hanahan and Weinberg (Cell 100(1):57---70, 2000) are a framework for viewing cancer within a common set of ...

We consider a pseudo-inversion operation inspired by biological events, such as DNA sequence transformations, where only parts of a string are reversed. We define the pseudo-inversion of a string $$w = uxv$$w=uxv to be the set of all strings $$v^Rxu^R$$...

Three results are shown on producibility in the hierarchical model of tile self-assembly. It is shown that a simple greedy polynomial-time strategy decides whether an assembly is producible. The algorithm can be optimized to use $$O(|\alpha | \log ^2 |\...

A hybrid network of evolutionary processors (HNEP) is a graph where each node is associated with a special rewriting system called an evolutionary processor, an input filter, and an output filter. Each evolutionary processor is given a finite set of one ...

In the abstract Tile Assembly Model (aTAM), the phenomenon of cooperation occurs when the attachment of a new tile to a growing assembly requires it to bind to more than one tile already in the assembly. Often referred to as "temperature-2" systems, ...

Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, we consider SN P systems with the following restriction: at each step ...

One way to depict a crystallographic structure is by a periodic (di)graph, i.e., a graph whose group of automorphisms has a translational subgroup of finite index acting freely on the structure. We establish a relationship between periodic graphs ...

In this paper we consider the time complexity of adding two n-bit numbers together within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system components are square tiles with ...

Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finite ...

We introduce a new property of tile self-assembly systems that we call size-separability. A system is size-separable if every terminal assembly is a constant factor larger than any intermediate assembly. Size-separability is motivated by the practical ...

This study proposes a new hybrid heuristic approach that combines the quantum particle swarm optimization (QPSO) technique with a local search phase to solve the binary generalized knapsack sharing problem (GKSP). The approach also incorporates a ...

Message passing algorithms (MPAs) have been traditionally used as an inference method in probabilistic graphical models. Some MPA variants have recently been introduced in the field of estimation of distribution algorithms (EDAs) as a way to improve the ...

Due to its NP-hard nature, it is still difficult to find an optimal solution for instances of the binary knapsack problem as small as 100 variables. In this paper, we developed a three-level hyper-heuristic framework to generate algorithms for the ...