Sakamoto, K.; Gouzu, H.; Komiya, K.; Kiga, D.; Yokoyama, S.; Yokomori, T.; Hagiya, M. Molecular computation by DNA hairpin formation. Science 2000, 288 (2469), 1223 -- 1226. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Minimum-Model DNA Computation on a Sequence of Probe Arrays - Ogihara, Ray (2002) (Correct)
....is carried out. Various computational models have been proposed in the past, including the test tube ssDNA model that was pioneered by Adleman [1] and further extended by Lipton [15, 5] the sticker DNA PNA model proposed by Roweis et al. 28, 4] the hairpin DNA model of Sakamoto et al. [29], the surface DNA model of Liu et al. 16] the enzymatic model of Rothemund [27] and of Benenseon et al. 3] and the two dimensional DNA self assembly model of Seeman and Winfree [33] The objective of this paper is to explore further the minimum DNA computation model proposed and studied in ....
J. Sakamoto, H. Gouzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, and M. Hagiya. Molecular computation by DNA hairpin formation. Science, 288:1223-1226, 2000.
Towards Molecular Programming - Hagiya (2002) (Correct)
....strategy dynamic programming, because variables are ordered and each variable is processed according to the result of processing its preceding variables. Ogihara and Ray proposed a similar algorithm that they called counting [26] Sakamoto et al. developed another refinement for 3 SAT problems [37]. Their machinery is called the SAT Engine, and it makes use of hairpin struc tures in DNA molecules (Fig. 2) In the SAT Engine, complementary literals are encoded by complementary nucleotide sequences in the sense of Watson and Crick. If a single stranded DNA molecule contains two literals that ....
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation, Science 288, 1223-1226 (2000)
Strand Design for Bio-Molecular Computation - Brenneman, Condon (2001) (1 citation) (Correct)
....be in a small range [10, 19, 61] or above some threshold [3] A third, much less accurate measure of the stability of a word is its GC content, or fraction of G s and C s. However because it is easy to measure and is amenable to combinatorial analysis, it is often used in constraining DNA words [21, 32, 49, 61]. A related simple estimate of melting temperature for short oligonucleotides is the 2 4 rule [3, 55] which is that the melting temperature of a sequence and its complement is approximately twice the number of A T base pairs plus 4 times the number of G C base pairs. Stability constraints on a ....
....strands with structure for DNA computation Properties of the secondary structure of DNA strands have been exploited for performing DNA computations in several ways. For example, Winfree et al. 58] proposed a method for self assembly of DNA molecules in a programmable fashion. Sakamoto et al. [49] have examined computational models, based on hairpin loop formation, in which both an input to the computation and state transition information are encoded in a DNA strand. Yurke et al. 62] constructed a simple DNA machine from three strands that acts as a molecular tweezers, fueled by auxiliary ....
[Article contains additional citation context not shown here]
K. Sakamoto, H. Gouzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, and M. Hagiya, "Molecular computation by DNA hairpin formation," Science, Vol. 288, May 2000, pages 12231226. 19
Strategies for the Development of a Peptide Computer - Hug, Schuler (Correct)
....uses nucleic acids to store information and it uses proteins to carry out orders of the genes. In addition to base pairing, computing with nucleic acids can exploit splicing mechanisms, cutting and religation of DNA (Winfree, 1996; Rothemund, 1996; Laun and Reddy, 1999) DNA hairpin formation (Sakamoto et al. 2000) or RNA editing (Landweber, 1999) The interactions between proteins and the enzymatic mechanisms are not as clearly defined as with nucleic acids and they are far more complex. Therefore, the use of proteins for calculations is expected to reach beyond our imaginations. The mathematical problems ....
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., & Hagiya, M. (2000). Molecular computation by DNA hairpin formation. Science, 288, 1223-1226.
An Indexed Bibliography of Genetic Algorithms in Chemistry.. - Jarmo T. Alander (2000) (Correct)
....1053, 1060] Publ. Fac. Electr. Eng. Ser. Eng. Phys. Serbia) 866] Quantitative Structure Activity Relationships, 930, 942, 274, 314, 1141] Quim. Nova, 376] Railw. Gaz. Int. 803] SAR and QSAR in Environmental Research, 1046] Sci. Rep. Res. Inst. Tohoku Univ. Ser. A, 857] Science, [577, 1056] Scienti c Computing in Chemical Engineering, 56] Scienti c Computing World, 642, 853] Seisan Gijutsu, 612] Simulation, 217] Soc. Pet. Eng. AIME Pap. SPE, 562] Solid State Commun, 845] Speech Communications, 11] SuperMenu, 897] Supramol. Chem. 1149] Surface Science, 848] ....
....D. 966, 300, 998, 1173] Goodman, Jonathan M. 1181] Goodsell, David S. 443] Goodsitt, Michell M. 139] Gordon, Richard K. 485] Gorges Schleuter, Martina, 222] Gottvald, A. 540, 541] Gottvald, Ale s, 1115, 1126] Gould, E. A. 435, 344] Gouws, Francois S. 223] Gouzu, Hidetaka, [577] Govindarajan, S. 1011] Gracia, J. de, 341] Grand, Scott Michael Le, 931, 954, 979, 412, 1086] Gray, H. F. 1123] Gree , D. J. 235] Greenwood, Garrison W. 154] Gregurick, Susan K. 1156] Griths, P. R. 1127] Griths, Peter R. 1131] Grim, Robert J. 834] Groot, Claas de, 176] ....
[Article contains additional citation context not shown here]
Kensaku Sakamoto, Hidetaka Gouzu, Ken Komiya, Daisuke Kiga, Shigeyuki Yokoyama, Takashi Yokomori, and Masami Hagiya. Molecular computation by DNA hairpin formation. Science, 288(5469):1223-1226, 19. May 2000. ga00aKensakuSakamoto.
Molecular Computing Machines - Yaakov Benenson Ehud (Correct)
No context found.
Sakamoto, K.; Gouzu, H.; Komiya, K.; Kiga, D.; Yokoyama, S.; Yokomori, T.; Hagiya, M. Molecular computation by DNA hairpin formation. Science 2000, 288 (2469), 1223 -- 1226.
DNA Starts to Learn Poker - David Harlan Wood (Correct)
No context found.
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science 288 (2000) 1223--1226 11
DNA Starts to Learn Poker - Wood, Bi, Kimbrough, Wu, Chen (Correct)
No context found.
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science 288 (2000) 1223--1226 11
Stochastic Local Search Algorithms for DNA Word Design - Dan Tulpan Holger (2002) (3 citations) (Correct)
No context found.
K. Sakamoto, H. Gouzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, and M. Hagiya, \Molecular computation by DNA hairpin formation," Science, Vol. 288, May 2000, pages 1223- 1226.
DNA-based parallel computation of simple arithmetic - Hug, Schuler (2001) (1 citation) (Correct)
No context found.
K. Sakamoto, H. Gouzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, and M. Hagiya. Molecular computation by DNA hairpin formation. Science, 288:1223{ 1226, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC