loading...
Fast Parallel DNA-Based Algorithms for Molecular Computation: Determining a Prime Number
Sydney, Australia July 04-July 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICITA.2005.145Third International Conference on Inf ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Weng-Long Chang, Southern Taiwan University of Technology
Michael (Shan-Hui) Ho, Southern Taiwan University of Technology
Minyi Guo, Southern Taiwan University of Technology
Xiaohong Jiang, Southern Taiwan University of Technology
Jingling Xue, Southern Taiwan University of Technology
Minglu Li, Southern Taiwan University of Technology
This paper demonstrates that testing whether a natural number is a prime number or not can also be solved with O(k³) biological operations, O(2^k) DNA library strands, O(k²) the longest length of DNA library and O(1) tubes, where k is the number of bits for a natural number to be checked.
Citation:
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo, Xiaohong Jiang, Jingling Xue, Minglu Li, "Fast Parallel DNA-Based Algorithms for Molecular Computation: Determining a Prime Number," icita, vol. 1, pp.447-452, Third International Conference on Information Technology and Applications (ICITA'05) Volume 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.