Abstract
We propose a procedure for solving the classical discrete extremal maximal matching problem with the Adleman–Lipton model as the computational architecture. We show that for an undirected graph with n edges the solution can be obtained in O(n 2) steps.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adleman, L.M., Molecular Computation of Solution to Combinatorial Problems, Sci., 1994, vol. 266, pp. 1021–1023.
Lipton, R.J., DNA Solution of HARD Computational Problems, Sci., 1995, vol. 268, pp. 542–545.
Qi Ouyang, Kaplan Peter, D., Liu Shumao, and Libchaber, A., DNA Solution of the Maximal Clique Problem, Sci., 1997, vol. 278, pp. 446–449.
Fujiwara, A., Matsumoto, K., and Wei Chen, Procedures for Logic and Arithmetic Operations with DNA Molecules, Int. J. Found. Comput. Sci., 2004, vol. 15, pp. 461–474.
Pǎun, G., Rozeberg, G., and Salomaa, A., DNA Computing, Berlin: Springer-Verlag, 1998
Li Dafa, Huang Hongtao, Li Xinxin, and Li Xiangrong, Hairpin Formation in DNA Computation Presents Limits for Large NP-complete Problems, BioSystem, 2003, vol. 72, pp. 203–207.
Amos, M., Gibbons, A., and Dunne, P.E., The Complexity and Viability of DNA Computations, in Biocomputing and Emergent Computation, Lundh, D., Olsson, B., and Narayanan, A, Eds., Singapore: World Scientific Press, 1997, pp. 165–173.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Original Russian Text © Li Wenxia, E.M. Patrikeev, Xiao Dongmei, 2015, published in Avtomatika i Telemekhanika, 2015, No. 10, pp. 106–112.
Rights and permissions
About this article
Cite this article
Li, W., Patrikeev, E.M. & Xiao, D. A DNA Algorithm for the maximal matching problem. Autom Remote Control 76, 1797–1802 (2015). https://doi.org/10.1134/S0005117915100070
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117915100070