Two-step search for DNA sequence design

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 6, 2004, Pages 1446-1453

  Kashiwamura, Satoshi ^a   Kameda, Atsushi ^b   Yamamoto, Masahito ^a   Ohuchi, Azuma ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

^b Japan Science and Technology Agency   (Japan)

Author keywords

DNA computing; DNA sequence design problem; Random generator; Two step search

Indexed keywords

ALGORITHMS; BIOTECHNOLOGY; CHEMICAL REACTIONS; COMPUTER AIDED ANALYSIS; ENZYMES; HYDROGEN BONDS; SIMULATED ANNEALING;

DNA COMPUTING; DNA SEQUENCE DESIGN PROBLEM; RANDOM GENERATOR; TWO-STEP SEARCH;

DNA;

EID: 3042592025     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (10)

1. L.M. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol.266, pp.1021-1024, 1994.
2. H.T. Allawi and J. SantaLucia, Jr., "Thermodynamics and NMR of internal G·T mismatches in DNA," Biochemistry, vol.36, pp. 10581-10594, 1997.
3. M. Arita, A. Nishikawa, H. Hagiya, K. Komiya, H. Gouzu, and K. Sakamoto, "Improving sequence design for DNA computing," Proc. GECCO'00 (Genetic and Evolutionary Computation Conference), pp.875-882, 2000.
4. M. Arita and S. Kobayashi, "DNA sequence design using templates," New Generation Computing, vol.20, pp.263-277, 2002.
5. R.J. Deaton, R.C. Murphy, M. Garzon, D.R. Franceschetti, and S.E. Stevens, Jr., "Good encodings for DNA-based solutions to combinatorial problems," Proc. DNA Based Computers II, DIMACS Workshop, June 1996, ed., L.F. Landweber and E.B. Baum, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.44, pp.247-258, 1999.
6. D.C. Tulpan, H.H. Hoos, and A.E. Condon, "Stochastic local search algorithms for DNA word design," in DNA Computing, Lecture Notes in Computer Science, ed. M. Hagiya and A. Ohuchi, vol.2568, pp.229-241, Springer-Verlag, 2003.
7. M. Garzon, R. Deaton, L.F. Nino, and E. Stevens, "Encoding genomes for DNA computing," Proc. Third Annual Genetic Programming Conf., pp.684-690, 1998.
8. S. Kobayashi, T. Kondo, and M. Arita, "On template method for DNA sequence design," in DNA Computing, Lecture Notes in Computer Science, ed. M. Hagiya and A. Ohuchi, vol.2568, pp.205-214, Springer-Verlag, 2003.
9. I.H. Lee, S.Y. Shin, and B.T. Zhang, "DNA sequence optimization using constrained multi-objective evolutionary algorithm," Proc. CEC'03 (Congress on Evolutionary Computation), pp.2270-2276, 2003.
10. R. Lipton, "DNA solution of hard combinatorial problems," Science, vol.268, pp.542-545, 1995.