RNS Bases in Computer Architecture for DNA Sequence Application

In this paper we present an RNS bases algorithm with architecture implementation for gene sequence applications. Based on the existing RNS arithmetic algorithm, investigations were 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, analysis of Smith Waterman Algorithm based on DNA sequence computing. Its limitations and open issues for future research were highlighted.