Buch, Englisch, 400 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 628 g
Reihe: Texts in Theoretical Computer Science. An EATCS Series
New Computing Paradigms
Buch, Englisch, 400 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 628 g
Reihe: Texts in Theoretical Computer Science. An EATCS Series
ISBN: 978-3-642-08388-4
Verlag: Springer
This is the first book on DNA computing, a molecular approach that may revolutionize computing-replacing silicon with carbon and microchips with DNA molecules. The book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory. It then brings the reader to the most advanced theories develop thus far in this emerging research area.
Zielgruppe
Graduate
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Technische Informatik Grid-Computing & Paralleles Rechnen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Technische Wissenschaften Technik Allgemein Nanotechnologie
- Mathematik | Informatik EDV | Informatik Technische Informatik Hochleistungsrechnen, Supercomputer
- Technische Wissenschaften Verfahrenstechnik | Chemieingenieurwesen | Biotechnologie Biotechnologie Industrielle Biotechnologie
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur
- Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Technische Informatik Quantencomputer, DNA-Computing
Weitere Infos & Material
Introduction: DNA Computing in a Nutshell.- I: Background and Motivation.- 1 DNA: Its Structure and Processing.- 2 Beginnings of Molecular Computing.- II: Mathematical Theory.- 3 Introduction to Formal Language Theory.- 4 Sticker Systems.- 5 Watson—Crick Automata.- 6 Insertion-Deletion Systems.- 7 Splicing Systems.- 8 Universality by Finite H Systems.- 9 Splicing Circular Strings.- 10 Distributed H Systems.- 11 Splicing Revisited.
