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

Authors:
Daniel Manrique;Alfonso Rodríguez-Patón;Petr Sosík
Affiliations:
Departamento Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n, Boadilla del Monte, 28660 Madrid, Spain;Departamento Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n, Boadilla del Monte, 28660 Madrid, Spain;Departamento Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n, Boadilla del Monte, 28660 Madrid, Spain and Research Institu ...
Venue:
Theoretical Computer Science
Year:
2011

Citing 9
Cited 0

Molecular computation of solutions to combinatorial problems

Science
DNA models and algorithms for NP-complete problems

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Concrete Math

Concrete Math
DNA sequence design using templates

New Generation Computing
A Clause String DNA Algorithm for SAT

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Theoretical and Experimental DNA Computation (Natural Computing Series)

Theoretical and Experimental DNA Computation (Natural Computing Series)
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

Journal of Global Optimization
Error suppression mechanisms for DNA tile self-assembly and their simulation

Natural Computing: an international journal
Cooperating local search for the maximum clique problem

Journal of Heuristics

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.