DNA Based Computers II

by Landweber, Laura F.; Baum, Eric B.

• ISBN13: 9780821807569
• ISBN10: 0821807560
• Format: Hardcover
• Copyright: 1998-10-01
• Publisher: Amer Mathematical Society

Summary

The fledgling field of DNA computers began in 1994 when Leonard Adleman surprised the scientific community by using DNA molecules, protein enzymes, and chemicals to solve an instance of a hard computational problem. This volume presents results from the second annual meeting on DNA computers held at Princeton only one and one-half years after Adleman's discovery. By drawing on the analogy between DNA computing and cutting-edge fields of biology (such as directed evolution), this volume highlights some of the exciting progress in the field and builds a strong foundation for the theory of molecular computation.

Table of Contents

A sticker based model for DNA computation

On applying molecular computation to the data encryption standard

Massively parallel DNA computation: Expansion of symbolic determinants

Universal DNA computing models based on the splicing operation

Running dynamic programming algorithms on a DNA computer

A molecular computation of the road coloring problem

DNA based molecular computation: Template-template interactions in PCR

Use of a horizontal chain reaction for DNA-based addition

Computation with DNA: Matrix multiplication

A surface-based approach to DNA computation

Mesoscopic computer engineering: Automating DNA-based molecular computing via traditional practices of parallel computer architecture design

Error-resistant implementation of DNA computations

Making DNA computers error resistant

Active transport in biological computing

RNA based computing: Some examples from RNA catalysis and RNA editing

Universal computation via self-assembly of DNA: Some theory and experiments

The perils of polynucleotides: The experimental gap between the design and assembly of unusual DNA structures

DNA sequences useful for computation

A restricted genetic alphabet for DNA computing

Good encodings for DNA-based solutions to combinatorial problems

DNA computations can have global memory

Exascale computer algebra problems interconnect with molecular reactions and complexity theory

Table of Contents provided by Publisher. All Rights Reserved.