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 ch...

Full description

Saved in:
Bibliographic Details
Published inThird International Conference on Information Technology and Applications : 4-7 July 2005, Sydney, Australia : proceedings Vol. 1; pp. 447 - 452 vol.1
Main Authors Weng-Long Chang, Ho, M., Minyi Guo, Xiaohong Jiang, Jingling Xue, Minglu Li
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Concurrent computing
Data mining
DNA computing
Encoding
Error correction
Information management
Information technology
Libraries
Space technology
Testing
Online AccessGet full text
ISBN0769523161
9780769523163
DOI10.1109/ICITA.2005.145

Cover

More Information
Summary: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.
ISBN:0769523161
9780769523163
DOI:10.1109/ICITA.2005.145