In Vitro Implementation of k-shortest Paths Computation with Graduated PCR

In this paper, an in vitro implementation of DNA computing for solving k-shortest paths problem of a weighted graph is reported. The encoding is designed in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generation, parallel overlap assembly is employed for efficient generation of all candidate answers. After the initial solution is subjected to amplification by polymerase chain reaction (PCR), k-shortest paths could be visualized by polyacrylamide gel electrophoresis (PAGE) and the selection can be done. The visualization of the output, in fact, relies on the appearance of DNA bands on a gel image. Further, it is shown that a method called graduated PCR is a good subsequent bio-molecular reaction for obtaining molecular information hidden in the output DNA. Graduated PCR is also crucial to prove the correctness of the in vitro computation. The experimental results show the effectiveness of the proposed DNA-based computation and prove that the k-shortest paths problem has been successfully solved on a DNA computer.

[1]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[2]  Byoung-Tak Zhang,et al.  Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly , 2004, DNA.

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

[4]  李幼升,et al.  Ph , 1989 .

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

[6]  Wolfgang Banzhaf,et al.  DNASequencesGenerator: A Program for the Construction of DNA Sequences , 2001, DNA.

[7]  H. Lehmann,et al.  Nucleic Acid Research , 1967 .

[8]  Ajit Narayanan,et al.  DNA algorithms for computing shortest paths , 1998 .

[9]  Zhang Deng-rong,et al.  Algorithm and its application of N shortest paths problem , 2001, 2001 International Conferences on Info-Tech and Info-Net. Proceedings (Cat. No.01EX479).

[10]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems with DNA molecules encoding numerical values. , 2004, Bio Systems.

[11]  W. Stemmer.  DNA shuffling by random fragmentation and reassembly: in vitro recombination for molecular evolution. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

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

[13]  K. Jayaraman,et al.  Polymerase chain reaction-mediated gene synthesis: synthesis of a gene coding for isozyme c of horseradish peroxidase. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[14]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

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

[17]  Nicos Christofides,et al.  An efficient implementation of an algorithm for finding K shortest simple paths , 1999, Networks.

[18]  R. DeSalle,et al.  PCR jumping in clones of 30-million-year-old DNA fragments from amber preserved termites (Mastotermes electrodominicus) , 2005, Experientia.

[19]  P D Kaplan,et al.  Parallel overlap assembly for the construction of computational DNA libraries. , 1997, Journal of theoretical biology.

[20]  W. Stemmer,et al.  Single-step assembly of a gene and entire plasmid from large numbers of oligodeoxyribonucleotides. , 1995, Gene.

[21]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[22]  Marzuki Khalid,et al.  Experimental Implementation of Direct-Proportional Length-Based DNA Computing for Numerical Optimization of the Shortest Path Problem , 2007, Int. J. Unconv. Comput..

[23]  Toshihide Ibaraki,et al.  An efficient algorithm for K shortest simple paths , 1982, Networks.

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

[25]  Marzuki Khalid,et al.  Direct-Proportional Length-Based DNA Computing for Shortest Path Problem , 2004, Int. J. Comput. Sci. Appl..

[26]  Shivaram Subramanian,et al.  Routing algorithms for dynamic, intelligent transportation networks , 1999 .

[27]  M. Pollack.  Letter to the Editor—The kth Best Route Through a Network , 1961 .

[28]  Richard Pavley,et al.  A Method for the Solution of the Nth Best Path Problem , 1959, JACM.

[29]  S. Ho,et al.  Site-directed mutagenesis by overlap extension using the polymerase chain reaction. , 1989, Gene.

[30]  N. Sugimoto,et al.  Improved thermodynamic parameters and helix initiation factor to predict stability of DNA duplexes. , 1996, Nucleic acids research.

[31]  Masahito Yamamoto,et al.  DNA Solution of the Shortest Path Problem by Concentration Control , 2000 .

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