IWO Algorithm Based on Niche Crowding for DNA Sequence Design
Authors:
- 25 March 2016
- journal article
- research article
- Published by Springer Nature in Interdisciplinary Sciences: Computational Life Sciences
- Vol. 9 (3) , 341-349
Abstract
The design of DNA sequences is essential for the implementation of DNA computing, where the quantity and quality can directly affect the accuracy and efficiency of calculations. Many studies have focused on the design of good DNA sequences to make DNA computing more reliable. However, DNA sequence design needs to satisfy various constraints at the same time, which is an NP-hard problem. In this study, we specify appropriate constraints that should be satisfied in the design of DNA sequences and we propose evaluation formulae. We employ the Invasive Weed Optimization (IWO) algorithm and the niche crowding in the algorithm to solve the DNA sequence design problem. We also improve the spatial dispersal in the traditional IWO algorithm. Finally, we compared the sequences obtained with existing sequences based on the results obtained using a comprehensive fitness function, which demonstrated the efficiency of the proposed method.Keywords
Funding Information
- NSFC (61425002)
This publication has 12 references indexed in Scilit:
- DNA Word Set Design Based on Minimum Free EnergyIEEE Transactions on Nanobioscience, 2010
- Application of a novel IWO to the design of encoding sequences for DNA computingComputers & Mathematics with Applications, 2009
- A novel numerical optimization algorithm inspired from weed colonizationEcological Informatics, 2006
- Multiobjective Evolutionary Optimization of DNA Sequences for Reliable DNA ComputingIEEE Transactions on Evolutionary Computation, 2005
- DNA Sequence Design Based on Template StrategyJournal of Chemical Information and Computer Sciences, 2003
- DNA sequence design using templatesNew Generation Computing, 2002
- Developing Support System for Sequence Design in DNA Computing2002
- On Combinatorial DNA Word DesignJournal of Computational Biology, 2001
- Automated constraint-based nucleotide sequence selection for DNA computationBioSystems, 1999
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994