String Assembly in Networks of Evolutionary Processors

In this paper, we introduce a new way of communication in networks of evolutionary processors (NEPs) where the filtered communicated strings are appended according to different variants of the overlap operation. These NEPs aim at modelling self-assembly in complex biological systems. We show that these networks with three nodes are computationally complete devices, furthermore they are able to solve NP-complete problems efficiently.