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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F11%3A%230003708" target="_blank" >RIV/47813059:19240/11:#0003708 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2011.09.004" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2011.09.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2011.09.004" target="_blank" >10.1016/j.tcs.2011.09.004</a>

Result language
angličtina
Original language name
On the scalability of biocomputing algorithms: The case of the maximum clique problem
Original language description
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 solutionsare dramatically improved in comparison with previous approaches to the same problem and, theoretically, they would allow to process graphs with thousands of vertices.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)