On the scalability of biocomputing algorithms: The case of the maximum clique problem

The paper aims at demonstrating and confirming that breadth first search or pruning techniques can substantially improve the effectiveness of biomolecular algorithms. A breadth first search-based DNA algorithm solving the maximum clique problem for a graph is presented, and its complexity and scalability parameters are studied. The analysis shows that parameters like the number of steps, the length and volume of DNA strands, the number of enzymes and the concentration of the molecules encoding solutions are dramatically improved in comparison with previous approaches to the same problem and, theoretically, they would allow to process graphs with thousands of vertices. These parameters are also compared with several related results focusing on the scalability of DNA computing methods. Finally, an analysis of error-resistance of the algorithm is given.

[1]  Mitsunori Ogihara,et al.  DNA-based parallel computation by "counting" , 1997, DNA Based Computers.

[2]  Vincenzo Manca,et al.  A Clause String DNA Algorithm for SAT , 2001, DNA.

[3]  Li Ken.  Improved Volume Molecular Solutions for the Maximum Clique Problem on DNA-Based Supercomputing , 2008 .

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

[5]  Etsuji Tomita,et al.  An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments , 2001, J. Glob. Optim..

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

[7]  M Hagiya,et al.  A DNA-based in vitroGenetic Program , 2002, Journal of biological physics.

[8]  Dan Boneh,et al.  Running dynamic programming algorithms on a DNA computer , 1996, DNA Based Computers.

[9]  Martyn Amos,et al.  Error-resistant implementation of DNA computations , 1996, DNA Based Computers.

[10]  T. Head,et al.  Aqueous computing: writing on molecules , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

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

[13]  Mauro Brunato,et al.  Cooperating local search for the maximum clique problem , 2011, J. Heuristics.

[14]  Thomas Bäck,et al.  Evolutionary Computation as a Paradigm for DNA-Based Computing , 2002 .

[15]  David Harlan Wood,et al.  DNA Based Computers III , 1999 .

[16]  E. Shapiro,et al.  An autonomous molecular computer for logical control of gene expression , 2004, Nature.

[17]  Eric Bach,et al.  DNA Models and Algorithms for NP-Complete Problems , 1998, J. Comput. Syst. Sci..

[18]  Robert A. Meyers,et al.  Encyclopedia of Complexity and Systems Science , 2009 .

[19]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[20]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation , 1999, Bull. EATCS.

[21]  Richard J. Lipton,et al.  Making DNA computers error resistant , 1996, DNA Based Computers.

[22]  Satoshi Murata,et al.  Error suppression mechanisms for DNA tile self-assembly and their simulation , 2009, Natural Computing.

[23]  Mi Lu,et al.  A new approach to advance the DNA computing , 2003, Appl. Soft Comput..

[24]  Xu Zhou,et al.  Improved Volume Molecular Solutions for the Maximum Clique Problem on DNA-Based Supercomputing: Improved Volume Molecular Solutions for the Maximum Clique Problem on DNA-Based Supercomputing , 2009 .

[25]  Alfonso Rodríguez-Patón,et al.  A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem , 2007, Biosyst..

[26]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[27]  B. Alberts.  Efficient separation of single-stranded and double-stranded deoxyribonucleic acid in a dextran-polyethylene glycol two-phase system. , 1967, Biochemistry.

[28]  Panos M. Pardalos,et al.  Handbook of combinatorial optimization. Supplement , 2005 .

[29]  Karl-Heinz Zimmermann,et al.  Efficient DNA sticker algorithms for NP-complete graph problems , 2002 .

[30]  Ralf Jungmann,et al.  From DNA nanotechnology to synthetic biology , 2008, HFSP journal.

[31]  L F Landweber,et al.  Chess games: a model for RNA based computation. , 1999, Bio Systems.

[33]  Hiroshi Yoshida,et al.  Solution to 3-SAT by breadth first search , 1999, DNA Based Computers.

[34]  T. Kunkel,et al.  DNA polymerase fidelity and the polymerase chain reaction. , 1991, PCR methods and applications.

[35]  Satoshi Kobayashi,et al.  DNA sequence design using templates , 2002, New Generation Computing.

[36]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation (Natural Computing Series) , 2005 .