The power of networks of Watson-Crick D0L systems

E. Csuhaj-Varjú, Arto Salomaa

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The notion of a network of Watson-Crick D0L systems was recently introduced, [7]. 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, [3]. 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.

Original languageEnglish
Pages (from-to)106-118
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2950
Publication statusPublished - 2004

Fingerprint

DNA
DNA Computing
Hamiltonians
Computer Communication Networks
Hamiltonian path
Population Growth
Satisfiability Problem
Complementarity
Parallelism
Linear Time
Distributed Systems
Computational complexity
Language
NP-complete problem
Equipment and Supplies
Research
Power (Psychology)

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{3d97e4a19fa649f9afb3fca13a20b464,
title = "The power of networks of Watson-Crick D0L systems",
abstract = "The notion of a network of Watson-Crick D0L systems was recently introduced, [7]. 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, [3]. 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.",
author = "E. Csuhaj-Varj{\'u} and Arto Salomaa",
year = "2004",
language = "English",
volume = "2950",
pages = "106--118",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - The power of networks of Watson-Crick D0L systems

AU - Csuhaj-Varjú, E.

AU - Salomaa, Arto

PY - 2004

Y1 - 2004

N2 - The notion of a network of Watson-Crick D0L systems was recently introduced, [7]. 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, [3]. 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.

AB - The notion of a network of Watson-Crick D0L systems was recently introduced, [7]. 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, [3]. 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.

UR - http://www.scopus.com/inward/record.url?scp=35048861407&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048861407&partnerID=8YFLogxK

M3 - Article

VL - 2950

SP - 106

EP - 118

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -