Networks of Splicing Processors with Various Topologies

We consider networks whose nodes host splicing processors, that is processors that are able to simulate the DNA recombination by splicing. Several topologies for the underlying graph of these networks are investigated. More precisely, we show that each network of splicing processors with some underlying graph can be directly converted into an equivalent network having an underlying graph of a different topology. Several common topologies are considered: full-mesh, star, grid, and wheel (ring-star). We also investigate the time and size complexity of each of these simulations.