References

Adams, J., 1998. On the application of DNA based computation. MSc Thesis, Department of Computer Science, University of Western Ontario, Canada.

Adleman, L.M., 1994. Molecular computation of solutions to combinatorial problems. Science, 266: 1021-1024.
CrossRef  |  PubMed  |  Direct Link  |  

Anonymous, 2014. Vertex cover problem | Set 1 (Introduction and approximate algorithm). Noida, Uttar Pradesh, India. https://www.geeksforgeeks.org/vertex-cover-problem-set-1-introduction-approximate-algorithm-2/

Anonymous, 2014. What is DNA?. AZoNetwork, Australia. https://www.news-medical.net/life-sciences/What-is-DNA.aspx

Anonymous, 2016. Clique problem. Wikimedia Foundation, California, USA. https://en.wikipedia.org/wiki/Decision_problem

Hasudungan, R. and R.A. Bakar, 2013. DNA computing for solving distribution center location problem. Proceedings of the IEEE International Conference on Control System, Computing and Engineering, November 29-December 1, 2013, IEEE, Mindeb, Malaysia, ISBN:978-1-4799-1506-4, pp: 563-567.

Hasudungan, R. and R.A. Bakar, 2013. DNA computing to solve vertex coloring problem. Proceedings of the International Conference on Advanced Computer Science Applications and Technologies, December 23-24, 2013, IEEE, Kuching, Malaysia, ISBN:978-1-4799-2758-6, pp: 341-345.

Sridhar, R. and S. Balasubramaniam, 2011. GIS integrated DNA computing for solving travelling salesman problem. Proceedings of the IEEE International Symposium on Computers and Informatics, March 20-23, 2011, IEEE, Kuala Lumpur, Malaysia, ISBN:978-1-61284-689-7, pp: 402-406.

Xu, J., X. Qiang, Y. Yang, B. Wang and D. Yang et al., 2011. An unenumerative DNA computing model for vertex coloring problem. IEEE. Trans. Nanobiosci., 10: 94-98.
CrossRef  |  Direct Link  |