论文信息 - Fast parallel DNA-based algorithms for molecular computation: determining a prime number

Fast parallel DNA-based algorithms for molecular computation: determining a prime number

This paper demonstrates that testing whether a natural number is a prime number or not can also be solved with O(k/sup 3/) biological operations, O(2/sup k/) DNA library strands, O(k/sup 2/) the longest length of DNA library and O(1) tubes, where k is the number of bits for a natural number to be checked.

[1] Minyi Guo,et al. Towards solution of the set-splitting problem on gel-based DNA computing , 2004, Future Gener. Comput. Syst..

[2] Minyi Guo,et al. Fast parallel molecular algorithms for DNA-based computation: factoring integers , 2004, Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering.

[3] Minyi Guo,et al. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing. , 2005, Bio Systems.

[4] Minyi Guo,et al. Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing , 2004, IEICE Trans. Inf. Syst..

[5] Minyi Guo,et al. Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing , 2004, Parallel Comput..

[6] Minyi Guo,et al. Molecular solutions for the subset-sum problem on DNA-based supercomputing. , 2004, Bio Systems.

[7] M. Guo,et al. Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model. , 2003, Bio Systems.