LEADER 06860nam 22007695 450 001 9910143885603321 005 20200706014751.0 010 $a3-540-36440-4 024 7 $a10.1007/3-540-36440-4 035 $a(CKB)1000000000211904 035 $a(SSID)ssj0000322718 035 $a(PQKBManifestationID)11243201 035 $a(PQKBTitleCode)TC0000322718 035 $a(PQKBWorkID)10296257 035 $a(PQKB)11708438 035 $a(DE-He213)978-3-540-36440-5 035 $a(MiAaPQ)EBC3071685 035 $a(PPN)155227238 035 $a(EXLCZ)991000000000211904 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDNA Computing $e8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers /$fedited by Masami Hagiya, Azuma Ohuchi 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XII, 344 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2568 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-00531-5 320 $aIncludes bibliographical references and index. 327 $aSelf-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. 330 $aBiomolecular 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 DNA Based Computers has been a forum where scientists with di?erent backgrounds, yet sharing a common interest in biomolecular computing, meet and present their latest results. Continuing this tradition, the 8th International Meeting on DNA Based Computers (DNA8) focuses on the current theoretical and experimental results with the greatest impact. Papers and poster presentations were sought in all areas that relate to b- molecular computing, including (but not restricted to): algorithms and appli- tions, analysis of laboratory techniques/theoretical models, computational p- cesses in vitro and in vivo, DNA-computing-based biotechnological applications, DNA devices, error evaluation and correction, in vitro evolution, models of biomolecular computing (using DNA and/or other molecules), molecular - sign, nucleic acid chemistry, and simulation tools. Papers and posters with new experimental results were particularly encouraged. Authors who wished their work to be considered for either oral or poster presentation were asked to select from one of two submission ?tracks?: ? Track A - Full Paper ? Track B - One-Page Abstract For authors with late-breaking results, or who were submitting their manuscript to a scienti?c journal, a one-page abstract, rather than a full paper, could be submitted in Track B. Authors could (optionally) include a preprint of their full paper, for consideration only by the program committee. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2568 606 $aMathematical logic 606 $aComputers 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 $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$aMathematical logic. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aBioinformatics. 615 14$aMathematical Logic and Foundations. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aArtificial Intelligence. 615 24$aBioinformatics. 676 $a511.3 702 $aHagiya$b Masami$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOhuchi$b Azuma$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 $a9910143885603321 996 $aDNA Computing$9378179 997 $aUNINA