LEADER 06924nam 22008415 450 001 9910144207603321 005 20251116234453.0 010 $a1-280-30681-5 010 $a9786610306817 010 $a3-540-24628-2 024 7 $a10.1007/b95518 035 $a(CKB)1000000000212304 035 $a(DE-He213)978-3-540-24628-2 035 $a(SSID)ssj0000140397 035 $a(PQKBManifestationID)11157368 035 $a(PQKBTitleCode)TC0000140397 035 $a(PQKBWorkID)10052762 035 $a(PQKB)11177775 035 $a(MiAaPQ)EBC3088865 035 $a(PPN)155165240 035 $a(EXLCZ)991000000000212304 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDNA Computing $e9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 1-3, 2003, revised Papers /$fedited by Junghuei Chen, John Reif 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (IX, 212 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2943 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-20930-1 320 $aIncludes bibliographical references and index. 327 $aNew Experimental Tools -- A Lab-on-a-Chip Module for Bead Separation in DNA-Based Concept Learning -- Parallel Translation of DNA Clusters by VCSEL Array Trapping and Temperature Control with Laser Illumination -- Chemical Switching and Molecular Logic in Fluorescent-Labeled M-DNA -- RCA-Based Detection Methods for Resolution Refutation -- Theory -- Word Design for Molecular Computing: A Survey -- Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved -- Deadlock Decidability in Partial Parallel P Systems -- Computer Simulation and Sequence Design -- Languages of DNA Based Code Words -- Secondary Structure Design of Multi-state DNA Machines Based on Sequential Structure Transitions -- Analyzing Secondary Structure Transition Paths of DNA/RNA Molecules -- Self-Assembly and Autonomous Molecular Computation -- Self-Assembled Circuit Patterns -- One Dimensional Boundaries for DNA Tile Self-Assembly -- Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly -- Experimental Solutions -- A DNA-Based Memory with In Vitro Learning and Associative Recall -- Efficiency and Reliability of Semantic Retrieval in DNA-Based Memories -- Nearest-Neighbor Thermodynamics of DNA Sequences with Single Bulge Loop -- New Computing Models -- Mathematical Considerations in the Design of Microreactor-Based DNA Computers -- Towards a Re-programmable DNA Computer -- In Vitro Translation-Based Computations -- Autonomous Biomolecular Computer Modeled after Retroviral Replication -- Biomolecular Computing by Encoding of Regulated Phosphorylation-Dephosphorylation and Logic of Kinase-Phosphatase in Cells -- Conformational Addressing Using the Hairpin Structure of Single-Strand DNA. 330 $aBiomolecular computing is an interdisciplinary ?eld that draws together mol- ular biology, DNA nanotechnology, chemistry, physics, computer science and mathematics. Theannualinternationalmeeting onDNA-based computationhas been an exciting forum where scientists of di?erent backgrounds who share a common interest in biomolecular computing can meet and discuss their latest results. The central goal of this conference is to bring together experimentalists and theoreticians whose insights can calibrate each others? approaches. The 9th Annual International Meeting on DNA Based Computers was held during June 1?4, 2003 in the University of Wisconsin, Madison, USA. The meeting had 106 registered participants from 12 countries around the world. On the ?rst day of the meeting, we had three tutorials: the ?rst was on self-assembly of DNA nano structures which focused on the basic techniques of using designed DNA nano molecules to be self-assembled onto larger structures for computational purposes. This tutorial was given by Hao Yan of Duke U- versity. The second tutorial was given by Chengde Mao of Purdue University in which Dr. Mao presented basic DNA biochemistry that was designed for non experimentalists. The third tutorial was given by Max Garzon of the Univ- sity of Memphis. Dr. Garzon gave a lecture on computational complexity which was tailored for non-computer scientists. The next three days were for invited plenary lectures, and regular oral and poster presentations. Invited plenary l- turesweregivenbyHelenBermanofRutgersUniversity(USA),GiancarloMauri of the University of Milan (Italy), Guenter von Kiedrowski of Ruhr University (Germany), and Sorin Istrail of Celera/Applied Biosystems. Theorganizerssoughtto attractthemostsigni?cantrecentresearchwith the highestimpactonthedevelopmentofthediscipline. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2943 606 $aLogic, Symbolic and mathematical 606 $aComputers 606 $aChemistry, Physical and theoretical 606 $aAlgorithms 606 $aArtificial intelligence 606 $aBioinformatics 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aTheoretical and Computational Chemistry$3https://scigraph.springernature.com/ontologies/product-market-codes/C25007 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aBioinformatics$3https://scigraph.springernature.com/ontologies/product-market-codes/L15001 615 0$aLogic, Symbolic and mathematical. 615 0$aComputers. 615 0$aChemistry, Physical and theoretical. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aBioinformatics. 615 14$aMathematical Logic and Foundations. 615 24$aComputation by Abstract Devices. 615 24$aTheoretical and Computational Chemistry. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aArtificial Intelligence. 615 24$aBioinformatics. 676 $a621.39/1 702 $aChen$b Junghuei$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aReif$b John$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on DNA-Based Computers. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144207603321 996 $aDNA Computing$9378179 997 $aUNINA