Abstract
This paper gets DNA computing mechanism and realization through DNA molecular structure. It proposes a DNA solution on surface for minimal set covering problem, and presents specific applications and algorithm evaluation. All possible results are listed in the surface of the calculation template, which, at the same time, are verified whether the results meet the conditions for the realization of the strong parallelism of DNA computing. Meanwhile, when complementary oligonucleotide gather nucleotide clips occur, it should be decided whether to hybridize through the catalyst, reducing human intervention and improving efficiency. Finally, computer simulations demonstrate the feasibility of the model.
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
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Molecular computation of solution tocombinatorial problems. Science (266), 1021–1024 (1994)
Bard, J.F., Purnomo, H.W.: Preference Scheduling for nurses using column generation. European Journal of Operational Research 164, 510–534 (2005)
Roweis, S., Winfree, E., Burgoyne, R., et al.: A sticker based architecture for dnacomputation. In: Proceedings of the Second Annual Meeting on DNA Based Computers. DIM ACS: Series in Discrete Mathematics and Theoretical ComputerScience, p. 127. American Mathematical Society, Princeton (1996)
Wenbin, L., Lin, G., et al.: Surface of DNA computing model of the maximum matching problem. Electronics (10) (2003)
Cui, L., Xuncai, Z.: Of coding sequences in DNA computing optimization design project. Computer Science Research (7), 195–198 (2007)
Xun, Z., Hailan, Z., et al.: Research progress and prospect of DNA computing. Computer Engineering and Applications 43 (2007)
Yang, Y., Shiping, S., et al.: DNA molecular computing and advances in DNA computer, vol. 53. Chinese Science Bulletin, Beijing (2008)
Gull, Z.X., Wenbin, L., et al.: Study on calculation of DNA coding and algorithm. Electronics 7 (2007)
Mingtao, W., Chunming, Y., et al.: For minimum set cover problem based on DNA paste model. Journal of University of Shanghai for Science 30, 121–124 (2008)
Yafei, T., Jiaxiu, Z.: Improved sticker model minimum point covering problem. Journal of Electronics and Information 27 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zang, W., Liu, X., Li, X. (2014). A DNA Solution on Surface for Minimal Set Covering Problem. In: Zu, Q., Vargas-Vera, M., Hu, B. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2013. Lecture Notes in Computer Science, vol 8351. Springer, Cham. https://doi.org/10.1007/978-3-319-09265-2_74
Download citation
DOI: https://doi.org/10.1007/978-3-319-09265-2_74
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09264-5
Online ISBN: 978-3-319-09265-2
eBook Packages: Computer ScienceComputer Science (R0)