Conference Paper

The Complexity and Viability of DNA Computations.

Conference: Biocomputing and emergent computation: Proceedings of BCEC97
Source: DBLP
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: DNA computing has recently generated much interest as a result of pioneering work by Adleman and Lipton. Their DNA algorithms worked on graph representations but no indication was provided as to how information on the arcs between nodes on a graph could be handled. The aim of this paper is to extend the basic DNA algorithmic techniques of Adleman and Lipton by proposing a method for representing simple arc information --- in this case, distances between cities in a simple map. It is also proposed that the real potential of DNA computing for solving computationally hard problems will only be realised when algorithmic steps which currently require manual intervention are replaced by executable DNA which operate on DNA strands in test-tubes. 1 Computationally hard problems and DNA computing Both Adleman's (1994) and Lipton's (1995) algorithms deal with graphs where there are no labels on the arcs, nor is there any indication provided as to how such labels can be handl...
  • [Show abstract] [Hide abstract]
    ABSTRACT: Without Abstract
    04/2006: pages 56-64;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications of DNA computing. In this paper, we demonstrate the theoretical developments by discussing a number of selected topics. We also give an introduction to the basic structure of DNA and the basic DNA processing tools.
    Theoretical Computer Science 01/2002; · 0.49 Impact Factor