Computing with Bio-molecules: Theory and Experiments
Springer, Jan 1, 1998 - Computers - 352 pages
Molecular computing (especially DNA computing) means using bio-molecules as a support for computations and devising computers. This is in contrast to the current opposite direction of research, the classic one, where computers are used in studying molecules (especially DNA), a field now commonly termed the science of bioinformatics. Using DNA as a "chip" or support for computation is not a new idea, and has been speculated upon since the 1950's. Adleman's 1994 report on solving the Hamiltonian Path Problem in a graph, using only biochemical laboratory techniques, was the revolutionary turning point in making possible the construction of large computers of huge parallelism, which are able to incorporate the features of matching, splicing (cross-over), insertion, deletions, etc., of data structures (strings and languages) - all features typical of the living DNA molecule. DNA computing is a domain of clear interdisciplinary work, and is definitely a field in rising expansion. Still, a lot of work has to be done, both from a mathematical and a biochemical point of view. This book brings together over 20 international contributions on the theoretical and experimental works of scientists in search of the bio-computer. The style of the contributions are that of research papers and surveys. Being one of the first volumes of its type in this new exciting field, this book will be of equal interest to computer scientists, mathematicians, and biochemists alike.
What people are saying - Write a review
We haven't found any reviews in the usual places.
7r-calculus Adleman algorithm alphabet annealing array splicing system axioms binary strings biology Boolean circuits building blocks cell complementary Computer Science consider construct context context-free cross-over defined Definition denote DNA Based Computers DNA computing DNA molecules DNA strands DNA strings double stranded edge encoding extended H system finite automata finite automaton finite set formal language theory formula function gates genetic grammar graph Hamiltonian Path Problem hybridization images input interaction Lemma length linguistic Lipton logical Mathematical metaphors molecular computing molecules monoid multiset nucleotides obtained oligonucleotides output pair path patterns Paun problem proof reaction recombination recursively enumerable languages regular language relation represent representation respectively restriction enzyme result Rozenberg Salomaa sequence simulation solution splicing languages splicing operation splicing rules Springer-Verlag step sticker systems structure subset substring symbols tape test tube Theorem transitive closure Turing Machines universal variables vertex Watson-Crick finite automaton