The notion of a network of Watson-Crick D0L systems was recently introduced, . It is a distributed system of deterministic language defining devices making use of Watson-Crick complementarity. The research is continued in this paper, where we establish three results about the power of such networks. Two of them show how it is possible to solve in linear time two well-known NP-complete problems, the Hamiltonian Path Problem and the Satisfiability Problem. Here the characteristic feature of DNA computing, the massive parallelism, is used very strongly. As an illustration we use the prepositional formula from the celebrated recent paper, . The third one shows how in the very simple case of four-letter DNA alphabets we can obtain weird (not even Z-rational) patterns of population growth.
|Number of pages||13|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - Dec 1 2004|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)