Fast matrix multiplication techniques based on the Adleman-Lipton model

Biology – Quantitative Biology – Quantitative Methods

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in the International Journal of Computer Engineering Research. Minor changes made to make the preprint as similar as

Scientific paper

10.5897/IJCER10.016

On distributed memory electronic computers, the implementation and association of fast parallel matrix multiplication algorithms has yielded astounding results and insights. In this discourse, we use the tools of molecular biology to demonstrate the theoretical encoding of Strassen's fast matrix multiplication algorithm with DNA based on an $n$-moduli set in the residue number system, thereby demonstrating the viability of computational mathematics with DNA. As a result, a general scalable implementation of this model in the DNA computing paradigm is presented and can be generalized to the application of \emph{all} fast matrix multiplication algorithms on a DNA computer. We also discuss the practical capabilities and issues of this scalable implementation. Fast methods of matrix computations with DNA are important because they also allow for the efficient implementation of other algorithms (i.e. inversion, computing determinants, and graph theory) with DNA.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Fast matrix multiplication techniques based on the Adleman-Lipton model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast matrix multiplication techniques based on the Adleman-Lipton model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast matrix multiplication techniques based on the Adleman-Lipton model will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-419937

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.