Return to home page
Searching: Otterbein library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
Conference International Conference on DNA Computing and Molecular Programming (25th : 2019 : Seattle, Wash.)
Title DNA computing and molecular programming : 25th International Conference, DNA 25, Seattle, WA, USA, August 5-9, 2019 : proceedings / Chris Thachuk, Yan Liu (eds.).
Imprint Cham : Springer, [2019]

View online
View online
Conference International Conference on DNA Computing and Molecular Programming (25th : 2019 : Seattle, Wash.)
Series Lecture notes in computer science ; 11648.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Lecture notes in computer science ; 11648.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Subject Molecular computers -- Congresses.
Alt Name Thachuk, Chris,
Liu, Yan (College teacher),
Add Title DNA 25
Description 1 online resource : illustrations (some color).
polychrome rdacc
Note Online resource; title from PDF title page (SpringerLink, viewed August 29, 2019).
Bibliography Note Includes bibliographical references and index.
Summary This book constitutes the refereed proceedings of the 25th International Conference on DNA Computing and Molecular Programming, DNA 25, held in Seattle, WA, USA, in August 2019. The 12 full papers presented were carefully selected from 19 submissions. The papers cover a wide range of topics relating to biomolecular computing such as algorithms and models for computation on biomolecular systems; computational processes in vitro and in vivo; molecular switches, gates, devices, and circuits; molecular folding and self-assembly of nanostructures; analysis and theoretical models of laboratory techniques; molecular motors and molecular robotics; information storage; studies of fault-tolerance and error correction; software tools for analysis, simulation, anddesign; synthetic biology and in vitro evolution; and applications in engineering, physics, chemistry, biology, and medicine. -- Provided by publisher.
Contents Intro; Preface; Organization; Contents; Chemical Reaction Networks and Stochastic Local Search; 1 Introduction; 2 Stochastic Chemical Reaction Networks; 3 Evaluating and Satisfying Circuits; 4 Formula Satisfiability; 5 Recognizing and Generating Patterns; 6 Sudoku; 7 Discussion; References; Implementing Arbitrary CRNs Using Strand Displacing Polymerase*-12pt; 1 Introduction; 1.1 Motivation for Our Work; 1.2 Our Contribution; 1.3 Paper Organization; 2 Strand Displacement with DNA Polymerase; 3 Implementation of Arbitrary Reactions; 3.1 Arbitrary Unimolecular Reactions
3.2 Arbitrary Bimolecular Reactions4 Scaling Reaction Systems for Practicality; 5 Applications; 5.1 Generalized Autocatalytic Amplifier; 5.2 Molecular-Scale Consensus Network; 5.3 Molecular-Scale Dynamic Oscillator; 6 Discussion; 6.1 Experimental Demonstration and Considerations; 6.2 Replenishing Supporting Gates with Buffered Reaction; 7 Conclusion; References; Real-Time Equivalence of Chemical Reaction Networks and Analog Computers*-12pt; 1 Introduction; 2 Preliminaries; 3 Real-Time Equivalence of CRNs and GPACs; 4 e and Are Real-Time Computable by CRNs; 5 Conclusion; References
A Reaction Network Scheme Which Implements Inference and Learning for Hidden Markov Models1 Introduction; 2 Hidden Markov Models and the Baum Welch Algorithm; 3 Chemical Baum-Welch Algorithm; 3.1 Reaction Networks; 3.2 Baum-Welch Reaction Network; 4 Analysis and Simulations; 5 Related Work; 6 Discussion; A Appendix; A.1 Comparing Points of Equilibria; A.2 Rate of Convergence Analysis; References; Efficient Parameter Estimation for DNA Kinetics Modeled as Continuous-Time Markov Chains; 1 Introduction; 1.1 Mean First Passage Time Estimation; 1.2 Parameter Estimation; 2 Preliminaries
2.1 The Multistrand Kinetic Simulator2.2 Gillespie's Stochastic Simulation Algorithm; 3 Methodology; 3.1 Mean First Passage Time Estimation; 3.2 Parameter Estimation; 4 Experiments; 4.1 Dataset; 4.2 Mean First Passage Time Estimation; 4.3 Parameter Estimation; 5 Discussion; References; New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1; 1 Introduction; 1.1 Main Results of This Paper; 1.2 Comparison with Related Work; 2 Preliminaries; 3 Lower Bound; 3.1 Window Movie Lemmas; 3.2 Counting Procedure for Undirected Self-assembly in 2D
3.3 Lower Bound for Undirected Self-assembly in 2D: Theorem 14 Upper Bound; 5 Future Work; References; Non-cooperatively Assembling Large Structures; 1 Introduction; 2 Definitions and Preliminaries; 2.1 Abstract Tile Assembly Model; 2.2 Paths and Non-cooperative Self-assembly; 3 The Tile Assembly System; 3.1 Definition of the Tile Assembly System; 3.2 Basic Properties; 3.3 Analysis of the Prefixes; 3.4 Analysis of the Tile Assembly System; 3.5 Conclusion of the Proof; 4 Open Questions; A Make Your Own Large Paths; References
ISBN 9783030268077 (electronic bk.)
3030268071 (electronic bk.)
9783030268084 (print)
ISBN/ISSN 10.1007/978-3-030-26807-7
OCLC # 1114336774
Additional Format Printed edition: 9783030268060.
Printed edition: 9783030268084.

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team