Self-assembly -- Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues -- Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications -- Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time -- Solutions to Computational Problems Through Gene Assembly -- Biomolecular Machines and Automata -- Toward Minimum Size Self-Assembled Counters -- A Realization of DNA Molecular Machine That Walks Autonomously by Using a Restriction Enzyme -- Autonomous Programmable Nanorobotic Devices Using DNAzymes -- Multi-fueled Approach to DNA Nano-Robotics -- Experimental Validation of the Transcription-Based Diagnostic Automata with Quantitative Control by Programmed Molecules -- DNA Memory with 16.8M Addresses -- Codes for DNA Memories and Computing -- Combining Randomness and a High-Capacity DNA Memory -- Design of Code Words for DNA Computers and Nanostructures with Consideration of Hybridization Kinetics -- Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence -- Sequence Design Support System for 4 × 4 DNA Tiles -- DNA Codes Based on Stem Similarities Between DNA Sequences -- Novel Techniques for DNA Computing in vitro -- Heuristic Solution to a 10-City Asymmetric Traveling Salesman Problem Using Probabilistic DNA Computing -- An Approach for Using Modified Nucleotides in Aqueous DNA Computing -- Modeling Non-specific Binding in Gel-Based DNA Computers -- Stepwise Assembly of DNA Tile on Surfaces -- An Interface for a Computing Model Using Methylation to Allow Precise Population Control by Quantitative Monitoring -- Novel Techniques for DNA Computing in silico -- Hardware Acceleration for Thermodynamic Constrained DNA Code Generation -- Hardware and Software Architecture for Implementing Membrane Systems: A Case of Study to Transition P Systems -- Towards a Robust Biocomputing Solution of Intractable Problems -- Discrete Simulations of Biochemical Dynamics -- DNA Splicing Systems -- Models and Languages -- Asynchronous Spiking Neural P Systems: Decidability and Undecidability -- On 5??3? Sensing Watson-Crick Finite Automata -- Equivalence in Template-Guided Recombination -- Watson-Crick Conjugate and Commutative Words -- DNA Coding Using the Subword Closure Operation.

This book constitutes the thoroughly refereed postproceedings of the 13th International Meeting on DNA Computing, DNA 13, held in Memphis, TN, USA, June 4-8, 2007. The 15 revised full papers and 5 short demos together with 10 poster abstracts presented were carefully selected during two rounds of reviewing and improvement from an initial total of 62 submissions. The papers are organized in topical sections on Self Assembly, Biomolecular Machines and Automata, Codes for DNA Memories and Computing, Novel Techniques for DNA Computing in Vitro, Novel Techniques for DNA Computing in Silico as well as Models and Languages.