Skip to main content
SpringerLink
Log in
Book cover

International Conference on Bio-Inspired Computing: Theories and Applications

BIC-TA 2019: Bio-inspired Computing: Theories and Applications pp 178–188Cite as

Reference Point Based Multi-objective Evolutionary Algorithm for DNA Sequence Design

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1160))

Abstract

DNA computing is a parallel computing model based on DNA molecules. High-quality DNA sequences can prevent unwanted hybridization errors in the computation process. The design of DNA molecules can be regarded as a multi-objective optimization problem, which needs to satisfy a variety of conflicting DNA encoding constraints and objectives. In this paper, a novel reference point based multi-objective optimization algorithm is proposed for designing reliable DNA sequences. In order to obtain balance Similarity and H-measure objective values, the reference point strategy is adapted to searching for idea solutions. Firstly, every individual should be assigned a rank value by the non-dominated sort algorithm. Secondly, the crowding distance is replaced by the distance to the reference point for each individual. Lastly, the proposed algorithm is compared with some state-of-the-art DNA sequence design algorithms. The experimental results show our algorithm can provide more reliability DNA sequences than existing sequence design techniques.

Supported by the National Natural Science Foundation of China (Grant Nos. U1803262, 61702383, 61602350).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Yang, R., Zhang, C., Gao, R.: A new bionic method inspired by DNA computation to solve the hamiltonian path problem. In: IEEE International Conference on Information and Automation (ICIA), pp. 219–225. IEEE (2017)

    Google Scholar 

  2. Song, B., Pérez-Jiménez, M.J., Pan, L.: An efficient time-free solution to SAT problem by P systems with proteins on membranes. J. Comput. Syst. Sci. 82(6), 1090–1099 (2016)

    Article  MathSciNet  Google Scholar 

  3. Wang, X.: Research on solution of TSP based on improved genetic algorithm. In: International Conference on Engineering Simulation and Intelligent Control (ESAIC), pp. 78–82. IEEE (2018)

    Google Scholar 

  4. Jafarzadeh, N., Iranmanesh, A.: A new graph theoretical method for analyzing DNA sequences based on genetic codes. MATCH-Commun. Math. Comput. Chem. 75(3), 731–742 (2016)

    MathSciNet  MATH  Google Scholar 

  5. Chaves-González, J.M., Vega-Rodrgíuez, M.A.: A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing. Appl. Math. Comput. 227, 291–308 (2014)

    MathSciNet  MATH  Google Scholar 

  6. Frutos, A.G., Liu, Q., Thiel, A.J., et al.: Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Res. 25(23), 4748–4757 (1997)

    Article  Google Scholar 

  7. Hartemink, A.J., Gifford, D.K., Khodor, J.: Automated constraint-based nucleotide sequence selection for DNA computation. Biosystems 52(1–3), 227–235 (1999)

    Article  Google Scholar 

  8. Feldkamp, U., Saghafi, S., Banzhaf, W., Rauhe, H.: DNASequenceGenerator: a program for the construction of DNA sequences. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 23–32. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-48017-X_3

    Chapter  MATH  Google Scholar 

  9. Arita, M., Nishikawa, A., Hagiya, M., et al.: Improving sequence design for DNA computing. In: Conference on Genetic and Evolutionary Computation, pp. 875–882. Morgan Kaufmann Publishers Inc. (2000)

    Google Scholar 

  10. Shin, S.Y., Kim, D.M., Lee, I.H., et al.: Evolutionary sequence generation for reliable DNA computing. In: 2002 Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, pp. 79–84. IEEE (2002)

    Google Scholar 

  11. Xu, C., Zhang, Q., Wang, B., et al.: Research on the DNA sequence design based on GA/PSO algorithms. In: The International Conference on Bioinformatics and Biomedical Engineering, pp. 816–819. IEEE (2008)

    Google Scholar 

  12. Kurniawan, T.B., Khalid, N.K., Ibrahim, Z., et al.: Sequence design for direct-proportional length-based DNA computing using population-based ant colony optimization. In: ICCAS-SICE, pp. 1486–1491. IEEE (2009)

    Google Scholar 

  13. Wang, Y., Shen, Y., Zhang, X., et al.: An improved non-dominated sorting genetic algorithm-II (INSGA-II) applied to the design of DNA codewords. Math. Comput. Simul. 151, 131–139 (2018)

    Article  MathSciNet  Google Scholar 

  14. Zhang, Q., Wang, B., Wei, X., et al.: DNA word set design based on minimum free energy. IEEE Trans. Nanobioscience 9(4), 273–277 (2010)

    Article  Google Scholar 

  15. Muhammad, M.S., Selvan, K.V., Masra, S.M.W., et al.: An improved binary particle swarm optimization algorithm for DNA encoding enhancement. In: Swarm Intelligence, pp. 1–8. IEEE (2011)

    Google Scholar 

  16. Mantha, A., Purdy, G., Purdy, C.: Improving reliability in DNA-based computations. In: IEEE International Midwest Symposium on Circuits and Systems, pp. 1047–1050. IEEE (2013)

    Google Scholar 

  17. Ibrahim, Z., Khalid, N.K., Lim, K.S., et al.: A binary vector evaluated particle swarm optimization based method for DNA sequence design problem. In: Research and Development, pp. 160–164. IEEE (2012)

    Google Scholar 

  18. Kurniawan, T.B., Khalid, N.K., Ibrahim, Z., et al.: Evaluation of ordering methods for DNA sequence design based on ant colony system. In: Second Asia International Conference on Modelling and Simulation, pp. 905–910. IEEE Computer Society (2008)

    Google Scholar 

  19. Jeong, K.S., Kim, M.H., Jo, H., et al.: Search of optimal locations for species-or group-specific primer design in DNA sequences: non-dominated sorting genetic algorithm II (NSGA-II). Ecol. Inform. 29, 214–220 (2015)

    Article  Google Scholar 

  20. Peng, X., Zheng, X., Wang, B., et al.: A micro-genetic algorithm for DNA encoding sequences design. In: International Conference on Control Science and Systems Engineering, pp. 10–14. IEEE (2016)

    Google Scholar 

  21. Deb, K., Sundar, J.: Reference point based multi-objective optimization using evolutionary algorithms. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 635–642. ACM (2006)

    Google Scholar 

  22. Pan, L., He, C., Tian, Y., Su, Y., Zhang, X.: A region division based diversity maintaining approach for many-objective optimization. Integr. Comput.-Aided Eng. 24(3), 279–296 (2017)

    Article  Google Scholar 

  23. He, C., Tian, Y., Jin, Y., Zhang, X., Pan, L.: A radial space division based evolutionary algorithm for many-objective optimization. Appl. Soft Comput. 61, 603–621 (2017)

    Article  Google Scholar 

  24. Pan, L., He, C., Tian, Y., Wang, H., Zhang, X., Jin, Y.: A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization. IEEE Trans. Evol. Comput. 23(1), 74–88 (2018)

    Article  Google Scholar 

  25. Pan, L., Li, L., He, C., Tan, K.C.: A subregion division-based evolutionary algorithm with effective mating selection for many-objective optimization. IEEE Trans. Cybern. (2019). https://doi.org/10.1109/TCYB.2019.2906679

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan, 430065, Hubei, China

    Haozhi Zhao, Zhiwei Xu & Kai Zhang

  2. Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System, Wuhan, 430065, Hubei, China

    Kai Zhang

Authors
  1. Haozhi Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiwei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kai Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Haozhi Zhao , Zhiwei Xu or Kai Zhang .

Editor information

Editors and Affiliations

  1. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  2. Zhengzhou University, Zhengzhou, China

    Jing Liang

  3. Zhongyuan University of Technology, Zhengzhou, China

    Boyang Qu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, H., Xu, Z., Zhang, K. (2020). Reference Point Based Multi-objective Evolutionary Algorithm for DNA Sequence Design. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1160. Springer, Singapore. https://doi.org/10.1007/978-981-15-3415-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3415-7_14

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3414-0

  • Online ISBN: 978-981-15-3415-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation