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

DOI10.1016/J.TCS.2011.09.004zbMATH Open1242.68292OpenAlexW2089507786MaRDI QIDQ433111FDOQ433111

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

Recommendations

• Genetic algorithm in DNA computing: a solution to the maximal clique problem
• Efficient DNA sticker algorithms for NP-complete graph problems
• Publication:4942034
• DNA models and algorithms for NP-complete problems
• scientific article; zbMATH DE number 1342109

zbMATH Keywords

DNA computingbreadth first searchmaximum clique problemerror-resistance

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theoretical and experimental DNA computation.
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• DNA models and algorithms for NP-complete problems
• Efficient DNA sticker algorithms for NP-complete graph problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Global weak solutions in three space dimensions for electrokinetic flow processes
• The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
• Asymptotic models for transport in large aspect ratio nanopores

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433111)