default search action
DIMACS Workshop: DNA Based Computers 1997
- Harvey Rubin, David Harlan Wood:
DNA Based Computers, Proceedings of a DIMACS Workshop, Philadelphia, Pennsylvania, USA, June 23-25, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 48, DIMACS/AMS 1999, ISBN 0-8218-0842-7 - Foreword. DNA Based Computers 1997: ix-
- Preface. DNA Based Computers 1997: xi-
- James G. Wetmur:
Physical chemistry of nucleic acid hybridization. 1-23 - Alexander J. Hartemink, David K. Gifford:
Thermodynamic simulation of deoxyoligonucleotide hybridization for DNA computation. 25-37 - Julia Khodor, David K. Gifford:
The efficiency of sequence-specific separation of DNA mixtures for biological computing. 39-46 - Junghuei Chen, David Harlan Wood:
A new DNA separation technique with a low error rate. 47-56 - Masami Hagiya, Masanori Arita, Daisuke Kiga, Kensaku Sakamoto, Shigeyuki Yokoyama:
Towards parallel evaluation and learning of Boolean μ-formulas with molecules. 57-72 - Elizabeth Laun, Kalluru J. Reddy:
Wet splicing systems. 73-83 - Frank Guarnieri, Martin Orlian, F. Carter Bancroft:
Parallel operations in DNA-based computation. 85-100 - Aviezri S. Fraenkel:
Protein folding, spin glass and computational complexity. 101-121 - Natasa Jonoska, Stephen A. Karl, Masahico Saito:
Creating 3-dimensional graph structures with DNA. 123-135 - Y. Gao, Max H. Garzon, R. C. Murphy, John A. Rose, Russell J. Deaton, Donald R. Franceschetti, Stanley Edward Stevens Jr.:
DNA implementation of nondeterminism. 137-148 - Vineet Gupta, Srinivasan Parthasarathy, Mohammed J. Zaki:
Arithmetic and logic operations with DNA. 149-159 - Laura F. Landweber, Richard J. Lipton, Michael O. Rabin:
DNA2DNA computations: A potential "killer app?". 161-172 - Andrew D. Ellington, Michael P. Robertson, Ken D. James, J. Colin Cox:
Strategies for DNA computing. 173-184 - Tony L. Eng, Benjamin M. Serridge:
A surface-based DNA algorithm for minimal set cover. 185-191 - Nobuhiko Morimoto, Masanori Arita, Akira Suyama:
Solid phase DNA solution to the Hamiltonian path problem. 193-206 - Bin Fu, Richard Beigel:
On molecular approximation algorithms for NP optimization problem. 207-216 - John H. Reif:
Local parallel biomolecular computation. 217-254 - Mitsunori Ogihara, Animesh Ray:
DNA-based parallel computation by "counting". 255-264 - Andrew J. Blumberg:
Parallel computation on a DNA substrate. 265-279 - Michael Conrad, Klaus-Peter Zauner:
Design for a DNA conformational processor. 281-287 - Tony L. Eng:
Linear DNA self-assembly with hairpins generates linear context-free grammars. 289-296 - Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Watson-Crick finite automata. 297-327 - Lila Kari, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems. 329-346 - Takashi Yokomori, Satoshi Kobayashi:
DNA-EC: A model of DNA-computing based on equality checking. 347-360 - Yasubumi Sakakibara, Claudio Ferretti:
Splicing on tree-like structures. 361-375
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.