DNA Computing
Springer Berlin (Verlag)
978-3-540-42076-7 (ISBN)
Engineered communications for microbial robotics.- Successive state transitions with I/O interface by molecules.- Solution of a satisfiability problem on a gel-based DNA computer.- Diophantine equations and splicing: A new demonstration of the generative capability of H systems.- About time-varying distributed H systems.- String tile models for DNA computing by self-assembly.- From molecular computing to molecular programming.- Graph replacement chemistry for DNA processing.- DNA and circular splicing?.- Molecular computing with generalized homogeneous P-systems.- Computationally inspired biotechnologies: Improved DNA synthesis and associative search using Error-Correcting Codes and Vector-Quantization?.- Challenges and applications for self-assembled DNA nanostructures?.- A space-efficient randomized DNA algorithm for k-SAT.- A DNA-based random walk method for solving k-SAT.- Solving computational learning problems of Boolean formulae on DNA computers.- The fidelity of annealing-ligation: A theoretical analysis.- DNA implementation of a Royal Road fitness evaluation.- Steady flow micro-reactor module for pipelined DNA computations.
| Erscheint lt. Verlag | 25.4.2001 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | CCLXXXVIII, 278 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 408 g |
| Themenwelt | Mathematik / Informatik ► Informatik |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Biocomputing • Bioinformatics • Biology • DNA Algorithms • DNA-Based Computers • DNA computing • DNA-Computing • fitness evaluation • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Molecular Biology • molecular computing • Molecular Programming • Robotics • Self-Assembly |
| ISBN-10 | 3-540-42076-2 / 3540420762 |
| ISBN-13 | 978-3-540-42076-7 / 9783540420767 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich