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

DOI10.1016/j.tcs.2011.09.004zbMath1242.68292OpenAlexW2089507786MaRDI QIDQ433111

Daniel Manrique, Alfonso Rodríguez-Patón, Petr Sosík

Publication date: 13 July 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.004

zbMATH Keywords

DNA computingmaximum clique problembreadth first searcherror-resistance

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Global weak solutions in three space dimensions for electrokinetic flow processes ⋮ Asymptotic models for transport in large aspect ratio nanopores

Cites Work

• DNA sequence design using templates
• Error suppression mechanisms for DNA tile self-assembly and their simulation
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• DNA models and algorithms for NP-complete problems
• Efficient DNA sticker algorithms for NP-complete graph problems
• Theoretical and experimental DNA computation.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the scalability of biocomputing algorithms: the case of the maximum clique problem