LEADER 06452nam 22007695 450 001 9910483945803321 005 20230406051518.0 010 $a3-540-77962-0 024 7 $a10.1007/978-3-540-77962-9 035 $a(CKB)1000000000490519 035 $a(SSID)ssj0000317280 035 $a(PQKBManifestationID)11251792 035 $a(PQKBTitleCode)TC0000317280 035 $a(PQKBWorkID)10289096 035 $a(PQKB)10534961 035 $a(DE-He213)978-3-540-77962-9 035 $a(MiAaPQ)EBC4976226 035 $a(MiAaPQ)EBC6458894 035 $a(Au-PeEL)EBL4976226 035 $a(CaONFJC)MIL134298 035 $a(OCoLC)1024284826 035 $a(PPN)123743583 035 $a(EXLCZ)991000000000490519 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDNA Computing$b[electronic resource] $e13th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers /$fedited by Max H. Garzon, Hao Yan 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XI, 292 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4848 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-77961-2 320 $aIncludes bibliographical references and index. 327 $aSelf-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. 330 $aBiomolecular/DNA computing is now well established as an interdisciplinary field where chemistry, computer science, molecular biology, physics, and mathematics come together with the common purpose of fundamental scientific understanding of biology and chemistry and its applications. This international meeting has been the premier forum where scientists with different backgrounds and a common focus meet to present their latest results and entertain visions of the future. In this tradition, about 100 participants converged in Memphis, Tennessee to hold the 13th International Meeting on DNA Computing during June 4?8, 2007, under the auspices of the International Society for Nanoscale Science, Computation and Engineering (ISNSCE) and The University of Memphis. The call for papers encouraged submissions of original, recent, and promising experimental and theoretical results in the field. The Call for Papers elicited some 62 submissions, almost perfectly balanced among the major theoretical and experimental categories. It is evidence of how well the interdisciplinary nature of the conference has truly matured that the major criterion of quality, agreed upon in advance by the Program Committee (PC), produced a nearly balanced program as well across the two major categories, full papers and talks with an abstract only. The program with the greatest perceived impact consisted of 24 papers for plenary oral talks; in addition, 15 full-paper posters and 10 poster abstracts were accepted, of which 5 authors were invited to give five short demos in a new submission category this year. The conference program retained the structure now customary for this meeting. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4848 606 $aComputer science 606 $aAlgorithms 606 $aBioinformatics 606 $aArtificial intelligence 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputational and Systems Biology 606 $aArtificial Intelligence 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aBioinformatics. 615 0$aArtificial intelligence. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aComputational and Systems Biology. 615 24$aArtificial Intelligence. 676 $a621.391 702 $aYan$b Hao$cPh. D., 702 $aGarzon$b Max$f1953- 712 12$aInternational Workshop on DNA Computing 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910483945803321 996 $aDNA Computing$9378179 997 $aUNINA