Abstract
Dominating set problem is a famous problem that finds applications in many fields. In this paper, an algorithm based on DNA Computing sticker-based model is proposed for finding dominating set in a given graph. Here, initially solution space containing all possible dominating sets of a graph is constructed and then the solution space is filtered iteratively until the desired solution set is obtained. Along with the operations in the sticker-based model, operations defined for DNA computer sticker-based model ALU is used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
L.M. Adelman, “Molecular Computation of solutions to Combinatorial Problems,” Science, 226, 1994.
Gambhir, Mahak & Kothapalli, Kishore, “A study on the minimum dominating set problem approximation in parallel,” International Conference on Contemporary Computing, 2017.
Hedefniemi S. T., Renu Laskar and John Pfaff, “A linear algorithm for finding a minimum dominating set in a cactus,” Discrete Applied Mathematics, Vol. No.13, Issue No. 6, 1975, pp.287–392.
Kari L., “DNA Computing: Arrival of biological mathematics ,” The Mathematical Intelligencer, Vol. No.19, 1997, pp.9–22.
Mayukh Sarkar, Prasun Ghosal, Saraju P. Mohanty, “Exploring the Feasibility of a DNA Computer: Design of an ALU Using Sticker-Based DNA Model,” IEEE Transactions on Nanobioscience, Vol. No.16, Issue No. 6, 2017, pp.383–399.
Mathieu Liedloff, “Finding a dominating set on bipartite graphs,” Information Processing Letter, Vol. No.107, Issue No. 5, 2008, pp.154–157.
Minyi Guo, Michael Ho, Weng-Long Chang, “Fast parallel molecular solution to the dominating-set problem on massively parallel computing,” Parallel Computing - Special issue: High-performance parallel bio-computing, Vol. No.30, Issue No. 9–10, 2004, pp.1109–1125.
T. Pramanik, S. Mondal, M. Pal , “Minimum 2-Tuple Dominating Set of an Interval Graph ,” International Journal of Combinatorics, 2011, pp.1–14.
S. Roweis, E. Winfree, R. Burgoyne, NV Chelyapov, MF Goodman, PW Rothemund , LM. Adleman , “A sticker-based model for DNA computation ,” J. Comput. Biol, Vol.No.5, Issue No. 4, 1998, pp.615–629.
Taghipour T., Rezaei M., H. A. Esmaili, “Applying surface-based DNA computing for solving the dominating set problem,” American Journal of Molecular Biology, Vol.No.2, 2012, pp.286–290.
Xu Zhou, GuangXue Yue, ZhiBang Yang, Ken;li Li “A New Approach for the Dominating-Set Problem by DNA-Based Supercomputing,” Proceedings of the Second Symposium International Computer Science and Computational Technology (ISCSCT’09), 2009, pp.514–516.
Zhixiang Yin, Jianzhong Cui, Yan Yang, Yin Ma, Wei Wang, Jin Yang, Xia Sun, (2012) “DNA computing for a dominating set problem based on sticker models,” Kybernetes, Vol. No. 41, Issue No. 9, pp.1343–1350,
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sudha, V., Easwarakumar, K.S. (2020). Algorithm for Finding Minimum Dominating Set Using Sticker Based Model in DNA Computing. In: Smys, S., Iliyasu, A.M., Bestak, R., Shi, F. (eds) New Trends in Computational Vision and Bio-inspired Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-41862-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-41862-5_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41861-8
Online ISBN: 978-3-030-41862-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)