{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[15,2,15,3],[16,2,16,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910483945803321"]
[null,null,"Titolo",null,"DNA Computing : 13th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers / / edited by Max H. Garzon, Hao Yan"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008"]
[null,null,"ISBN",null,"3-540-77962-0"]
[null,null,"Edizione",null,"[1st ed. 2008.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 292 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4848"]
[null,null,"Disciplina",null,"621.391"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Bioinformatics"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computational and Systems Biology"]
[{"$nulls":4},"Artificial Intelligence"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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 "]
[{"$nulls":4},"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 ofStudy 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."]
[null,null,null,"Sommario/riassunto","Biomolecular/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."]