AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
DNA Based Computers II
About this Title
Laura F. Landweber, Princeton University, Princeton, NJ and Eric B. Baum, NEC Research Institute, Princeton, NJ, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1999; Volume 44
ISBNs: 978-0-8218-0756-9 (print); 978-1-4704-4002-2 (online)
DOI: https://doi.org/10.1090/dimacs/044
MathSciNet review: MR1655279
MSC: Primary 68-06; Secondary 68Q05, 92D20
Table of Contents
Front/Back Matter
Chapters
- 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