论文信息 - Algorithm for Finding Minimum Dominating Set Using Sticker Based Model in DNA Computing - 字舞流文

Algorithm for Finding Minimum Dominating Set Using Sticker Based Model in DNA Computing

K. S. Easwarakumar | V. Sudha

[1] Minyi Guo,et al. Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing , 2004, Parallel Comput..

[2] Kishore Kothapalli,et al. A study on the minimum dominating set problem approximation in parallel , 2017, 2017 Tenth International Conference on Contemporary Computing (IC3).

[3] Madhumangal Pal,et al. Minimum 2-Tuple Dominating Set of an Interval Graph , 2011 .

[4] L. Karl. DNA computing: Arrival of biological mathematics , 1997 .

[5] Wei Wang,et al. DNA computing for a dominating set problem based on sticker models , 2012, Kybernetes.

[6] Stephen T. Hedetniemi,et al. A linear algorithm for finding a minimum dominating set in a cactus , 1986, Discret. Appl. Math..

[7] Saraju P. Mohanty,et al. Exploring the Feasibility of a DNA Computer: Design of an ALU Using Sticker-Based DNA Model , 2017, IEEE Transactions on NanoBioscience.

[8] Hassan Taghipour,et al. Applying Surface-Based DNA Computing for Solving the Dominating Set Problem , 2012 .

[9] Erik Winfree,et al. A Sticker-Based Model for DNA Computation , 1998, J. Comput. Biol..

[10] Mathieu Liedloff. Finding a dominating set on bipartite graphs , 2008, Inf. Process. Lett..