Abstract
In this paper we present an RNS algorithm and architecture implementation of gene sequence applications based on an existing RNS arithmetic algorithm. Investigation was made on RNS application and its inherent arithmetic advantages; data conversion algorithm from Decimal/Binary to RNS; the forward conversion; Conversion from RNS to Binary/Decimal; the reverse conversion using the Chinese remainder theorem CRT, conversion from RNS to mixed radix form with capability for effective computation performance, and analysis of Smith Waterman Algorithm based on DNA sequence computing. Its limitations and open issues for future research were highlighted.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
