Theoretical and Experimental DNA ComputationSpringer Science & Business Media, 2005. gada 17. okt. - 173 lappuses 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 Adleman’s 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 author’s 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. |
Saturs
Introduction | 5 |
A Primer | 22 |
Models of Molecular Computation | 70 |
Complexity Issues | 71 |
Physical Implementations 109 | 108 |
23 | 123 |
27 | 145 |
Cellular Computing | 147 |
References | 157 |
29 | 158 |
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
Adleman Alan Gibbons anneal biological blue Boolean circuit clique coloring combinational circuit complexity Computer Science construct copies CREW P-RAM cycle denoted depicted in Fig depth described detection PCR digestion distance(k DNA algorithm DNA computation DNA-based example Exclusion experiment experimental exponential FETCH(M gene genetic green Hamiltonian Path Hamiltonian Path Problem implementation initial library input instruction integer killer applications lac operon Landweber log S(n MDSs membrane memory locations micronucleus model of DNA module molecular computation multi-set NAND node NP-complete NP-complete problems O(log S(n oligonucleotides oligos output gate P-RAM algorithm parallel filtering model permutations polylogarithmic polymerase polynomial primer processor protein reactions Removal experiment remove operation restriction enzyme Sau3A sequence representing simulation solution specific step strands containing strands encoding strands of length strands representing strings structure substrands substrate template tile transitive closure Turing Machine variable vertex vertices volume of DNA