a Burroughs Wellcome Fund New Investigator in Molecular Parasitology.
Supported in part by NSF CCR-9633103 and AFOSR F49620-97-0190.
Preview
Unable to display preview. Download preview PDF.
References
Leonard M. Adleman. “Molecular Computation of Solution to Combinatorial Problems”. Science, 266:1021–1024, 1994.
M. Amos, A. Gibbons, P. Dunne. “The Complexity and Viability of DNA Computations”, CTAG-97001.
S. Roweis, E. Winfree, R. Burgoyne, N. Chelyapov, M. Goodman, P. Rothemund, L. Adleman, “A Sticker Based Architecture for DNA Computation”, draft 1996.
E. Bach, A. Condon, E. Glaser and C. Tanguay, DNA Models and Algorithms for NP-Complete Problems, Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 1996.
D. Beaver, Molecular Computing. Penn State University Tech Report CSE-95-001.
D. Boneh, C. Dunworth, R. Lipton, “Breaking DES Using a Molecular Computer”, Princeton CS Tech-Report number CS-TR-489-95.
D. Boneh, C. Dunworth, R. Lipton, J. Sgall, “On the Computational Power of DNA”, CS-TR-499-95.
D. Boneh, L. Landweber, R. Lipton. “Analog DNA Computations”, unpublished manuscript, July 1996.
D. Boneh and R. Lipton, “Making DNA Computers Error Resistant”, Princeton CS Tech-Report CS-TR-491-95.
R. Dramanac, “DNA sequence determination by hybridizationn: a strategy for efficient large-scale sequencing”, Science, 263, 596–596, 1994.
R. Karp, C. Kenyon, and O. Waarts. “Error-resilent DNA computation”. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, pages 458–467. ACM Press/SIAM, 1996.
Richard J. Lipton. “DNA Solution of Hard Computational Problems”. Science, 268:542–545, 1995.
M. Ogihara and A. Ray. “Simulating Boolean Circuits on a DNA Computer”, University of Rochester Technical Report 631, August 1996.
C. Papadimitrou, private communication, 1994.
J. Reif, “Parallel Molecular Computation: Models and Simulations”. Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1995.
M. Waterman, Introduction to Computational Biology, Chapman Hall, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Landweber, L.F., Lipton, R.J. (1997). DNA2DNA computations: A potential “killer app”?. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_164
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_164
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive