Vai al contenuto principale della pagina
Titolo: |
DNA Computing : 7th International Workshop on DNA-Based Computers, DNA7, Tampa, FL, USA, June 10-13, 2001, Revised Papers / / edited by Natasa Jonoska, Nadriaan C. Seeman
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Edizione: | 1st ed. 2002. |
Descrizione fisica: | 1 online resource (XI, 392 p.) |
Disciplina: | 511.3 |
Soggetto topico: | Computer hardware |
Mathematical logic | |
Computers | |
Algorithms | |
Artificial intelligence | |
Bioinformatics | |
Computer Hardware | |
Mathematical Logic and Foundations | |
Computation by Abstract Devices | |
Algorithm Analysis and Problem Complexity | |
Artificial Intelligence | |
Persona (resp. second.): | JonoskaNatasa |
SeemanNadriaan C | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Experimental Tools -- An Object Oriented Simulation of Real Occurring Molecular Biological Processes for DNA Computing and Its Experimental Verification -- Towards Optimization of PCR Protocol in DNA Computing -- DNASequenceGenerator: A Program for the Construction of DNA Sequences -- DNA Computing in Microreactors -- Cascadable Hybridisation Transfer of Specific DNA between Microreactor Selection Modules -- Theoretical Tools -- Coding Properties of DNA Languages -- Boundary Components of Thickened Graphs -- Probabilistic Computational Models -- Population Computation and Majority Inference in Test Tube -- DNA Starts to Learn Poker -- PNA-mediated Whiplash PCR -- Computer Simulation and Sequence Design -- Biomolecular Computation in Virtual Test Tubes -- Developing Support System for Sequence Design in DNA Computing -- The Fidelity of the Tag-Antitag System -- PUNCH: An Evolutionary Algorithm for Optimizing Bit Set Selection -- Algorithms -- Solving Knapsack Problems in a Sticker Based Model -- A Clause String DNA Algorithm for SAT -- A Proposal of DNA Computing on Beads with Application to SAT Problems -- Experimental Solutions -- Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 × 3 -- Solutions of Shortest Path Problems by Concentration Control -- Another Realization of Aqueous Computing with Peptide Nucleic Acid -- Experimental Confirmation of the Basic Principles of Length-only Discrimination -- Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability -- Nano-tech Devices -- Operation of a Purified DNA Nanoactuator -- DNA Scissors -- Biomimetic Tools -- A Realization of Information Gate by Using Enterococcus faecalis Pheromone System -- Patterns of Micronuclear Genes in Ciliates -- Peptide Computing - Universality and Complexity -- Programmed Mutagenesis Is a Universal Model of Computation -- New Computing Models -- Horn Clause Computation by Self-assembly of DNA Molecules -- DNA-based Parallel Computation of Simple Arithmetic -- Splicing Systems and Membranes -- On P Systems with Global Rules -- Computing with Membranes: Variants with an Enhanced Membrane Handling -- Towards an Electronic Implementation of Membrane Computing: A Formal Description of Non-deterministic Evolution in Transition P Systems -- Insertion-Deletion P Systems -- A Universal Time-Varying Distributed H System of Degree 1 -- A Note on Graph Splicing Languages. |
Titolo autorizzato: | DNA Computing ![]() |
ISBN: | 3-540-48017-X |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910143905303321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |