By Topic

Fast parallel molecular algorithms for DNA-based computation: factoring integers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Weng-Long Chang ; Dept. of Inf. Manage., Southern Taiwan Univ. of Technol., Tainan, Taiwan ; Ho, M.S. ; Minyi Guo

We propose three DNA-based algorithms - parallel subtractor, parallel comparator and parallel modular arithmetic - that formally verify our designed molecular solutions for factoring the product of two large prime numbers.

Published in:

Bioinformatics and Bioengineering, 2004. BIBE 2004. Proceedings. Fourth IEEE Symposium on

Date of Conference:

19-21 May 2004