Atjaunināt sīkdatņu piekrišanu

Theoretical and Experimental DNA Computation 2005 ed. [Hardback]

4.00/5 (3 ratings by Goodreads)
  • Formāts: Hardback, 173 pages, height x width: 235x155 mm, weight: 454 g, XIII, 173 p., 1 Hardback
  • Sērija : Natural Computing Series
  • Izdošanas datums: 23-Jun-2005
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540657738
  • ISBN-13: 9783540657736
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 91,53 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 107,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Theoretical and Experimental DNA Computation 2005 ed.Palielināt
  • Formāts: Hardback, 173 pages, height x width: 235x155 mm, weight: 454 g, XIII, 173 p., 1 Hardback
  • Sērija : Natural Computing Series
  • Izdošanas datums: 23-Jun-2005
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540657738
  • ISBN-13: 9783540657736
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783540657736.html
Keywords:
DNA computation has emerged in the last ten years as an exciting new - search ?eld at the intersection (and, some would say, frontiers) of computer science,biology,engineering,andmathematics.AlthoughanticipatedbyFe- man as long ago as the 1950s [ 59], the notion of performing computations at a molecular level was only realized in 1994, with Adlemans seminal work [ 3] on computing with DNA. Since then the ?eld has blossomed rapidly, with signi cant theoretical and experimental results being reported regularly. Several books [ 120, 39] have described various aspects of DNA compu- tion, but this is, to the authors best knowledge, the ?rst to bring together descriptions of both theoreticaland experimentalresults.The targetaudience is intentionally broad, including students as well as experienced researchers. We expect that users of the book will have some background in either c- puter science, mathematics, engineering, or the life sciences. The intention is that this book be used as a tutorial guide for newcomers to the ?eld as well as a reference text for people already working in this fascinating area. To this end, we include two self-contained tutorial chapters (1 and 2), which convey only those aspects of computer science and biology that are required to understand the subsequent material.

Recenzijas

From the reviews:









"Biomolecular computing, also known as DNA computing, has been a subject of research and scientific conversations for little over a decade. Amos has made an effort to bring the book closer to both theoreticians and the experimentalists. I found Amoss writing style very forthcoming, clear and friendly. It was a pleasure to read the book. Any graduate student or a researcher without prior knowledge about biomolecular computing will find this book informative, and a great introduction to the subject." (Nataa Jonoska, Genetic Programming and Evolvable Machines, Vol. 7, 2006)



"Amos describes the major theoretical models in common usage, and reports on the experimental implementations thereof. the value of this book is twofold. First, it serves as a good primer on this emerging field for the novice reader. Second, it provides an account of the authors contributions to the field . I would recommend the book to researchers in the field, and to graduate students as well as to those readers who are simply interested in the topic." (John Fulcher, Computing Reviews, April, 2006)



"The book is an overview of DNA computing. It touches both theoretical and experimental aspects. The book is a good introduction to DNA computing for both new researchers, and readers having general interests." (Maulik S. Dave, SIGACT News, Vol. 39 (2), 2008)

Introduction 1(4)
1 DNA: The Molecule of Life 5(18)
1.1 Introduction
5(1)
1.2 The Structure and Manipulation of DNA
6(1)
1.3 DNA as the Carrier of Genetic Information
7(3)
1.4 Operations on DNA
10(11)
1.5 Summary
21(1)
1.6 Bibliographical Notes
21(2)
2 Theoretical Computer Science: A Primer 23(22)
2.1 Introduction
23(2)
2.2 Algorithms and Automata
25(2)
2.3 The Turing Machine
27(2)
2.4 The Random Access Machine
29(4)
2.5 Data Structures
33(6)
2.6 Computational Complexity
39(4)
2.7 P and NP
43(1)
2.8 Summary
43(1)
2.9 Bibliographical Notes
44(1)
3 Models of Molecular Computation 45(26)
3.1 Introduction
45(1)
3.2 Filtering Models
46(14)
3.3 Splicing Models
60(1)
3.4 Constructive Models
61(2)
3.5 Membrane Models
63(6)
3.6 Summary
69(1)
3.7 Bibliographical Notes
70(1)
4 Complexity Issues 71(38)
4.1 Introduction
71(2)
4.2 An Existing Model of DNA Computation
73(3)
4.3 A Strong Model of DNA Computation
76(1)
4.4 Ogihara and Ray's Boolean Circuit Model
77(5)
4.4.1 Ogihara and Ray's Implementation
79(3)
4.5 An Alternative Boolean Circuit Simulation
82(2)
4.6 Proposed Physical Implementation
84(3)
4.7 Analysis
87(1)
4.8 Example Application: Transitive Closure
88(2)
4.9 P-RAM Simulation
90(4)
4.10 The Translation Process
94(6)
4.11 Assessment
100(2)
4.12 A Worked Example: The List Ranking Problem
102(4)
4.13 Summary
106(1)
4.14 Bibliographical Notes
107(2)
5 Physical Implementations 109(38)
5.1 Introduction
109(1)
5.2 Implementation of Basic Logical Elements
109(1)
5.3 Initial Set Construction Within Filtering Models
110(2)
5.4 Adleman's Implementation
112(3)
5.5 Evaluation of Adleman's Implementation
115(2)
5.6 Implementation of the Parallel Filtering Model
117(1)
5.7 Advantages of Our Implementation
118(1)
5.8 Experimental Investigations
119(16)
5.9 Other Laboratory Implementations
135(10)
5.9.1 Chess Games
136(2)
5.9.2 Computing on Surfaces
138(2)
5.9.3 Gel-Based Computing
140(1)
5.9.4 Maximal Clique Computation
141(2)
5.9.5 Other Notable Results
143(2)
5.10 Summary
145(1)
5.11 Bibliographical Notes
145(2)
6 Cellular Computing 147(10)
6.1 Introduction
147(3)
6.2 Successful Implementations
150(1)
6.3 Gene Unscrambling in Ciliates
150(1)
6.4 Biological Background
151(2)
6.4.1 IESs and MDSs
151(1)
6.4.2 Scrambled Genes
152(1)
6.4.3 Fundamental Questions
152(1)
6.5 Models of Gene Construction
153(2)
6.6 Summary
155(1)
6.7 Bibliographical Notes
156(1)
References 157(10)
Index 167