Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
DNA Based Computers V
 
Edited by: Erik Winfree :  California Institute of Technology, Pasadena, CA
David K. Gifford :  Massachusetts Institute of Technology, Cambridge, MA
A co-publication of the AMS and DIMACS
DNA Based Computers V
Hardcover ISBN:  978-0-8218-2053-7
Product Code:  DIMACS/54
List Price: $95.00
MAA Member Price: $85.50
AMS Member Price: $76.00
eBook ISBN:  978-1-4704-4012-1
Product Code:  DIMACS/54.E
List Price: $89.00
MAA Member Price: $80.10
AMS Member Price: $71.20
Hardcover ISBN:  978-0-8218-2053-7
eBook: ISBN:  978-1-4704-4012-1
Product Code:  DIMACS/54.B
List Price: $184.00 $139.50
MAA Member Price: $165.60 $125.55
AMS Member Price: $147.20 $111.60
Add to cart
DNA Based Computers V
Click above image for expanded view
DNA Based Computers V
Edited by: Erik Winfree :  California Institute of Technology, Pasadena, CA
David K. Gifford :  Massachusetts Institute of Technology, Cambridge, MA
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-2053-7
Product Code:  DIMACS/54
List Price: $95.00
MAA Member Price: $85.50
AMS Member Price: $76.00
eBook ISBN:  978-1-4704-4012-1
Product Code:  DIMACS/54.E
List Price: $89.00
MAA Member Price: $80.10
AMS Member Price: $71.20
Hardcover ISBN:  978-0-8218-2053-7
eBook ISBN:  978-1-4704-4012-1
Product Code:  DIMACS/54.B
List Price: $184.00 $139.50
MAA Member Price: $165.60 $125.55
AMS Member Price: $147.20 $111.60
Add to cart
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 54; 2000; 249 pp
    MSC: Primary 68; 92

    This proceedings volume presents the talks from the Fifth Annual Meeting on DNA Based Computers held at MIT. The conference brought together researchers and theorists from many disciplines who shared research results in biomolecular computation.

    Two styles of DNA computing were explored at the conference: 1) DNA computing based on combinatorial search, where randomly created DNA strands are used to encode potential solutions to a problem, and constraints induced by the problem are used to identify DNA strands that are solution witnesses; and 2) DNA computing based on finite-state machines, where the state of a computation is encoded in DNA, which controls the biochemical steps that advance the DNA-based machine from state to state.

    Featured articles include discussions on the formula satisfiability problem, self-assembly and nanomachines, simulation and design of molecular systems, and new theoretical approaches.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
    Readership

    Graduate students and research mathematicians interested in computer science; computer scientists; molecular biologists, biochemists, and physicists interested in how molecular systems compute.
  • Table of Contents
     
     
    • Chapters
    • When the Knight falls: On constructing an RNA computer
    • Solution to 3-SAT by breadth first search
    • In vitro selection for a OneMax DNA evolutionary computation
    • Liposome mediated biomolecular computation
    • Error correction in DNA computing: Misclassification and strand loss
    • DNA analog vector algebra and physical constraints on large-scale DNA-based neural network computation
    • On combinatorial DNA word design
    • Soft molecular computing
    • A study on the hybridization process in DNA computing
    • Simulating biological reactions: A modular approach
    • Experimental progress in computation by self-assembly of DNA tilings
    • 2D DNA self-assembly for satisfiability
    • YAC: Yet another computation model of self-assembly
    • DNA hybridization catalysts and molecular tweezers
    • Designing and selecting components for nucleic acid computers
    • Forbidding and enforcing
    • Computational power of gene rearrangement
    • Membrane computing based on splicing
    • DNA-based cryptography
  • Reviews
     
     

    • Overall this volume offers very enjoyable reading for someone who is interested in this topic ... As the editors conclude ... the future of the field looks bright.
      SIGACT News
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 54; 2000; 249 pp
MSC: Primary 68; 92

This proceedings volume presents the talks from the Fifth Annual Meeting on DNA Based Computers held at MIT. The conference brought together researchers and theorists from many disciplines who shared research results in biomolecular computation.

Two styles of DNA computing were explored at the conference: 1) DNA computing based on combinatorial search, where randomly created DNA strands are used to encode potential solutions to a problem, and constraints induced by the problem are used to identify DNA strands that are solution witnesses; and 2) DNA computing based on finite-state machines, where the state of a computation is encoded in DNA, which controls the biochemical steps that advance the DNA-based machine from state to state.

Featured articles include discussions on the formula satisfiability problem, self-assembly and nanomachines, simulation and design of molecular systems, and new theoretical approaches.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Readership

Graduate students and research mathematicians interested in computer science; computer scientists; molecular biologists, biochemists, and physicists interested in how molecular systems compute.
  • Chapters
  • When the Knight falls: On constructing an RNA computer
  • Solution to 3-SAT by breadth first search
  • In vitro selection for a OneMax DNA evolutionary computation
  • Liposome mediated biomolecular computation
  • Error correction in DNA computing: Misclassification and strand loss
  • DNA analog vector algebra and physical constraints on large-scale DNA-based neural network computation
  • On combinatorial DNA word design
  • Soft molecular computing
  • A study on the hybridization process in DNA computing
  • Simulating biological reactions: A modular approach
  • Experimental progress in computation by self-assembly of DNA tilings
  • 2D DNA self-assembly for satisfiability
  • YAC: Yet another computation model of self-assembly
  • DNA hybridization catalysts and molecular tweezers
  • Designing and selecting components for nucleic acid computers
  • Forbidding and enforcing
  • Computational power of gene rearrangement
  • Membrane computing based on splicing
  • DNA-based cryptography

  • Overall this volume offers very enjoyable reading for someone who is interested in this topic ... As the editors conclude ... the future of the field looks bright.
    SIGACT News
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Powered by MathJax
Please select which format for which you are requesting permissions.