NACST/Seq: A Sequence Design System with Multiobjective Optimization

The importance of DNA sequence design for reliable DNA computing is well recognized. In this paper, we describe a DNA sequence optimization system NACST/Seq that is based on a multiobjective genetic algorithm. It uses the concept of Pareto optimization to reflect many realistic characteristics of DNA sequences in real bio-chemical experiments flexibly. This feature allows to recommend multiple candidate sets as well as to generate the DNA sequences, which fit better to a specific DNA computing algorithm. We also describe DNA sequence analyzer that can examine and visualize the properties of given DNA sequences.

[1]  Max H. Garzon,et al.  Reliability and Efficiency of a DNA-Based Computation , 1998 .

[2]  Wolfgang Banzhaf,et al.  DNASequencesGenerator: A Program for the Construction of DNA Sequences , 2001, DNA.

[3]  Masami Hagiya,et al.  Improving Sequence Design for DNA Computing , 2000, GECCO.

[4]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[5]  Amit Marathe,et al.  On combinatorial DNA word design , 1999, DNA Based Computers.

[6]  In-Hee Lee,et al.  Evolutionary sequence generation for reliable DNA computing , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[7]  D. Gifford,et al.  Automated constraint-based nucleotide sequence selection for DNA computation. , 1999, Bio Systems.

[8]  Byoung-Tak Zhang,et al.  Code Optimization for DNA Computing of Maximal Cliques , 1999 .

[9]  R. Deaton,et al.  A DNA based implementation of an evolutionary search for good encodings for DNA computation , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[10]  Max H. Garzon,et al.  Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.

[11]  Masahito Yamamoto,et al.  Developing Support System for Sequence Design in DNA Computing , 2001, DNA.

[12]  Masami Hagiya,et al.  Towards parallel evaluation and learning of Boolean μ-formulas with molecules , 1997, DNA Based Computers.

[13]  Laura F. Landweber,et al.  PUNCH: An Evolutionary Algorithm for Optimizing Bit Set Selection , 2001, DNA.