DNA Computing 8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hagiya, Masami (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Ohuchi, Azuma (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2568
• Θέματα: Mathematical logic.; Computers.; Algorithms.; Artificial intelligence.; Bioinformatics.; Mathematical Logic and Foundations.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Artificial Intelligence.

Biomolecular computing has emerged as an interdisciplinary ?eld that draws - gether chemistry, computer science, mathematics, molecular biology, and physics. Our knowledge on DNA nanotechnology and biomolecular computing increases exponentially with every passing year. The international meeting on D...

Πίνακας περιεχομένων:

• Self-assembly and Autonomous Molecular Computation
• Self-assembling DNA Graphs
• DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice
• The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA
• Cascading Whiplash PCR with a Nicking Enzyme
• Molecular Evolution and Application to Biotechnology
• A PNA-mediated Whiplash PCR-based Program for In Vitro Protein Evolution
• Engineering Signal Processing in Cells: Towards Molecular Concentration Band Detection
• Applications to Mathematical Problems
• Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges
• Shortening the Computational Time of the Fluorescent DNA Computing
• How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top?
• Hierarchical DNA Memory Based on Nested PCR
• Binary Arithmetic for DNA Computers
• Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules
• Version Space Learning with DNA Molecules
• DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic
• Universal Biochip Readout of Directed Hamiltonian Path Problems
• Nucleic Acid Sequence Design
• Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure
• A PCR-based Protocol for In Vitro Selection of Non-crosshybridizing Oligonucleotides
• On Template Method for DNA Sequence Design
• From RNA Secondary Structure to Coding Theory: A Combinatorial Approach
• Stochastic Local Search Algorithms for DNA Word Design
• NACST/Seq: A Sequence Design System with Multiobjective Optimization
• A Software Tool for Generating Non-crosshybridizing Libraries of DNA Oligonucleotides
• Theory
• Splicing Systems: Regularity and Below
• On the Computational Power of Insertion-Deletion Systems
• Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport
• Conformons-P Systems
• Parallel Rewriting P Systems with Deadlock
• A DNA-based Computational Model Using a Specific Type of Restriction Enzyme
• Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations.