An Efficient RNS Arithmetic in Bioinformatics Sequences
This paper investigates the features and the limitation in the implementation of effective RNS computing algorithms using an special method of data representation and conversion in Residue Number System arithmetic as a helpful tool for enhancing Bioinformatics sequencing computing and to reduce the complexity of calculation in many applications. As required in DNA sequencing involving very high speed sequence comparator (VHSC) with real-time processing requirements. We consider and analyze different stages of data processing in RNS. Based on this analysis, we describe the process of conversion of algorithms using RNS-SWA based comparator with the representation of a large integer using a set of smaller integers, called residues. Emphasis was made on RNS implementation and its inherent arithmetic advantages; data conversion algorithm technique from Chinese remainder theorem CRT, to Mix radix conversion MRC performance, and analysis of Smith Waterman Algorithm base on DNA sequence computing.
Keywords: RNS Arithmetic, Moduli-selection, WNS, Smith- Waterman Algorithm, DNA, Bioinformatics, CRT, MRC
Download Full-Text
ABOUT THE AUTHORS
Olatunbosun Lukumon Olawale
Research student under Third Author in Kwara State university. Nigeria
Lawal Tunde Dauda
Co Student
Gbolagade Kazeem Alagbe
Major Supervisor
Olatunbosun Lukumon Olawale
Research student under Third Author in Kwara State university. Nigeria
Lawal Tunde Dauda
Co Student
Gbolagade Kazeem Alagbe
Major Supervisor
