DNA Computing for an Absolute 1-Center Problem: An Evolutionary Approach

Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science and mathematics. Thus, in this paper, the possibility of DNA-based computing to solve an absolute 1-center problem by molecular manipulations is presented. This is truly the first attempt to solve such a problem by DNA-based computing approach. Since, part of the procedures involve with shortest path computation, research works on DNA computing for shortest path Traveling Salesman Problem, in short, TSP are reviewed. These approaches are studied and only the appropriate one is adapted in designing the computation procedures. This DNA-based computation is designed in such a way that every path is encoded by oligonucleotides and the path’s length is directly proportional to the length of oligonucleotides. Using these properties, gel electrophoresis is performed in order to separate the respective DNA molecules according to their length. One expectation arise from this paper is that it is possible to verify the instance absolute 1-center problem using DNA computing by laboratory experiments.

[1]  Lixia Zhang,et al.  On the placement of Internet instrumentation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[3]  Masahito Yamamoto,et al.  A separation method for DNA computing based on concentration control , 2009, New Generation Computing.

[4]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[5]  Sudipto Guha,et al.  Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  L. Adleman.  Computing with DNA , 1998 .

[7]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[8]  Byoung-Tak Zhang,et al.  Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges , 2002, DNA.

[9]  Masahito Yamamoto,et al.  Local Search by Concentration-Controlled DNA Computing , 2001, Int. J. Comput. Intell. Appl..

[10]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[11]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[12]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[13]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[14]  Lisa Zhang,et al.  The access network design problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[15]  J. Patrick Fitch,et al.  An Engineering Introduction to Biotechnology , 2002 .

[16]  Cristian S. Calude,et al.  Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing , 2000 .

[17]  Erik Winfree,et al.  On applying molecular computation to the data encryption standard , 1999, DNA Based Computers.

[18]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).