A tissue P system and a DNA microfluidic device for solving the shortest common superstring problem

Abstract

Abstract. This paper describes a tissue P system for solving the Shortest Common Superstring Problem in linear time. This tissue P system is well suited for parallel and distributed implementation using a microfluidic device working with DNA strands. The tP system is not based on the usual brute force generate/test technique applied in DNA computing, but builds the space solution gradually. The possible solutions/superstrings are build step by step through the parallel distributed combination of strings using the overlapping concatenation operation. Moreover, the DNA microfluidic device solves the problem autonomously, without the need of external control or manipulation.

A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem

“…Many of these papers addressing both membrane and DNA computing have tackled computationally difficult problems (class NP-complete) (Ledesma et al, 2004(Ledesma et al, , 2005. NP-complete problems have two prominent features: (1) there are as yet no polynomial algorithms to solve them, and (2) all their "yes" instances are certified to be verifiable efficiently (Garey and Johnson, 1979).…”

An error-tolerant serial binary full-adder via a spiking neural P system using HP/LP basic neurons

“…After evaluating [12], several works have been presented on the possible implementations of P systems based on bionano technology [9] and microfluidic biochip technology [7].…”