Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8727)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: DNA 2014.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Table of contents (10 papers)
-
Front Matter
-
Back Matter
Other volumes
-
DNA Computing and Molecular Programming
Editors and Affiliations
Accessibility Information
Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.
Bibliographic Information
Book Title: DNA Computing and Molecular Programming
Book Subtitle: 20th International Conference, DNA 20, Kyoto, Japan, September 22-26, 2014. Proceedings
Editors: Satoshi Murata, Satoshi Kobayashi
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-11295-4
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0), Springer Nature Proceedings Computer Science
Copyright Information: Springer International Publishing Switzerland 2014
Softcover ISBN: 978-3-319-11294-7Published: 08 September 2014
eBook ISBN: 978-3-319-11295-4Published: 08 September 2014
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 161
Number of Illustrations: 51 b/w illustrations
Topics: Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Computational Biology/Bioinformatics, Artificial Intelligence, Data Structures, Discrete Mathematics in Computer Science
Keywords
- DNA computing
- DNA logic circuits
- DNA nanotechnology
- DNA origami
- DNA strand design
- DNA tile assembly
- RNA
- algorithmic self-assembly
- computation by chemical reaction
- design and analysis of chemical reaction network
- deterministic computation
- efficient computation
- molecular computing
- molecular robotics
- probabilistic computation
- space-filling curves
- turing computability
- algorithm analysis and problem complexity
- data structures