A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing

被引:14
作者
Chaves-Gonzalez, Jose M. [1 ]
Vega-Rodriguez, Miguel A. [1 ]
机构
[1] Univ Extremadura, Dept Comp & Commun Technol, Escuela Politecn, Caceres 10003, Spain
关键词
Multiobjective optimization; DNA sequence design; Multiobjective firefly algorithm; Multiobjective evolutionary algorithm; Molecular computing; DESIGN; COMPUTATION; OPTIMIZATION; ALGORITHM;
D O I
10.1016/j.amc.2013.11.032
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The reliability of artificially generated DNA molecules is a key factor for applications which depend on DNA-based technologies, such as DNA computing or nanotechnology. In those cases, interactions between sequences have to be controlled to avoid undesirable reactions. In the specific case of molecular computing, the design of robust sets of sequences prevent from incorrect computations because DNA sequences are designed in order to avoid potentially conflicting interactions between the DNA molecules within the artificially generated library. However, the design of reliable DNA libraries which can be used for molecular computing involves several heterogeneous and conflicting design criteria that cannot be properly modeled by using traditional optimization algorithms. In this paper, we formulate the problem as a multiobjective optimization problem and we solve it with a novel multiobjective algorithm based on the behaviour of fireflies. Specifically, our approach, multiobjective firefly algorithm (MO-FA), works with six different conflicting design criteria that measure the reliability of the generated sequences. Furthermore, in order to compare our results in multiobjective terms, we have also developed and adjusted the well-known fast non-dominated sorting genetic algorithm (NSGA-II). Results show that our proposal obtains very satisfactory results. In fact, the reliability of DNA sequences generated significantly surpasses the reliability of sequences obtained with other approaches previously published in the literature. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:291 / 308
页数:18
相关论文
共 49 条
  • [1] MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS
    ADLEMAN, LM
    [J]. SCIENCE, 1994, 266 (5187) : 1021 - 1024
  • [2] A polynomial-time DNA computing solution for the Bin-Packing Problem
    Alonso Sanches, Carlos Alberto
    Soma, Nei Yoshihiro
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (06) : 2055 - 2062
  • [3] [Anonymous], 2002, Evolutionary algorithms for solving multi-objective problems
  • [4] [Anonymous], 1999, P 1999 C EV COMP EV
  • [5] [Anonymous], 2009, STOCHASTIC ALGORITHM
  • [6] [Anonymous], 2011, INT ENCY STAT SCI
  • [7] DNA sequence design using templates
    Arita, M
    Kobayashi, S
    [J]. NEW GENERATION COMPUTING, 2002, 20 (03) : 263 - 277
  • [8] Arita M., 2000, Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, P875
  • [9] Strand design for biomolecular computation
    Brenneman, A
    Condon, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 287 (01) : 39 - 58
  • [10] Byoung-Tak Zhang, 1998, Genetic Programming 1998. Proceedings of the Third Annual Conference, P735