Abstract
Single-strand DNA can match with homologous double- stranded into a triple-stranded structure mediated by RecA protein.The paper provides a triple-stranded DNA computing model for minimum spanning tree problem. DNA fragments corresponding to edges are coded by double-stranded DNA, wrong hybridization does not take place and hairpin structure does not form. The single-strand DNA probe is bond with RecA protein, so the rate of wrong solution will reduce. And in this way, encoding complexity and the errors in computation will be decreased.
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
Zang, H., Jue, J., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-routed Optical WDM Networks. Opt. Netw. Mag 1, 47–60 (2000)
Fang, G., Zhang, S., Zhu, Y., Xu, J.: The DNA Computing Based on Triple Helix Nucleic Acid. China Journal of Bioinformatics 7(3), 181–185 (2009)
Yang, J., Yin, Z.: 0-1 Integer Programming Problem Based on Reca-Mediated Triple-Stranded DNA Structure. Computer Engineering and Applications 44(2), 76–79 (2008)
Sun, X., Yin, Z., Zhao, Q., Xu, F.: DNA Computing Model on Triple-stranded of the Whole Error Permutation Problems. Journal of Chuzhou University 14(2), 18–20 (2012)
Yin, Z., Zhang, F., Xu, J.: DNA Computing in Graph Theory and Combinatorial Optimization. Science Press (2004)
Ye, L.: A DNA Computing Algorithm for Solving the Knapsack Problem. In: Qu, X., Yang, Y. (eds.) IBI 2011, Part II. CCIS, vol. 268, pp. 84–90. Springer, Heidelberg (2012)
Zhou, X., Li, K., Yue, G., Yang, Z.: A Volume Molecular Solution for The Maximum Matching Problem on DNA-Based Computing. Computer Research and Development 48(11), 2147–2154 (2011)
Xu, J., Qiang, X., Yang, Y., Wang, B., Yang, D., Luo, L., Pan, L., Wang, S.: An unenumerative DNA computing model for vertex coloring problem. IEEE Transactions on Nanobioscience 10(2), 94–98 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, Z., Sun, X., Xu, F., Fang, X., Xu, H. (2014). A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_89
Download citation
DOI: https://doi.org/10.1007/978-3-662-45049-9_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45048-2
Online ISBN: 978-3-662-45049-9
eBook Packages: Computer ScienceComputer Science (R0)