DNA Computing
Springer Berlin (Verlag)
978-3-540-34161-1 (ISBN)
Self-correcting Self-assembly: Growth Models and the Hammersley Process.- Recognizing DNA Splicing.- On Computational Properties of Template-Guided DNA Recombination.- Towards Practical Biomolecular Computers Using Microfluidic Deoxyribozyme Logic Gate Networks.- DNA Recombination by XPCR.- An Algorithm for SAT Without an Extraction Phase.- Sensitivity and Capacity of Microarray Encodings.- Simple Operations for Gene Assembly.- Counting Time in Computing with Cells.- On Bounded Symport/Antiport P Systems.- Expectation and Variance of Self-assembled Graph Structures.- Hairpin Structures in DNA Words.- Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences.- Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication.- Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube.- Development of an In Vivo Computer Based on Escherichia coli.- Control of DNA Molecules on a Microscopic Bead Using Optical Techniques for Photonic DNA Memory.- Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity.- Analysis and Simulation of Dynamics in Probabilistic P Systems.- Experimental Validation of DNA Sequences for DNA Computing: Use of a SYBR Green I Assay.- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems.- Designing Nucleotide Sequences for Computation: A Survey of Constraints.- A Self-assembly Model of Time-Dependent Glue Strength.- Complexity of Compact Proofreading for Self-assembled Patterns.- A Microfluidic Device for DNA Tile Self-assembly.- Photo- and Thermoregulation of DNA Nanomachines.- Chain Reaction Systems Based on Loop Dissociation of DNA.- A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions.- Specificity of Hybridization Between DNA Sequences Based on Free Energy.- A Poor Man's Microfluidic DNA Computer.- Two Proteins for the Price of One: The Design of Maximally Compressed Coding Sequences.- Design of Autonomous DNA Cellular Automata.- Use of DNA Nanodevices in Modulating the Mechanical Properties of Polyacrylamide Gels.- Molecular Learning of wDNF Formulae.
Erscheint lt. Verlag | 15.5.2006 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XII, 444 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 774 g |
Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
Mathematik / Informatik ► Informatik ► Theorie / Studium | |
Schlagworte | Algorithm analysis and problem complexity • algorithms • Automata • Biocomputing • Bioinformatics • bio-inspired computing • Biomolecular computing • coding theory • Communication • Complexity • Complexity theory • DNA Algorithms • DNA-based computing • DNA Coding • DNA Computers • DNA computing • DNA devices • DNA nanostructure • Erfüllbarkeitsproblem der Aussagenlogik • learning • molecular computing • nanotechnology • Self-Organization |
ISBN-10 | 3-540-34161-7 / 3540341617 |
ISBN-13 | 978-3-540-34161-1 / 9783540341611 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich