To Develop Efficient and Time Effective Search Model for Comparing Nucleotide Sequences with Database

Abstract

Abstract

Searching of gene from their database is an important and common practice in various studies related to identification of similar genes against a query gene sequence. Our objective was to develop a faster search model by partitioning search space which is only possible through the numerical representation of genes that will satisfy test of reliability, uniqueness and speed required for this purpose. The result showed promise in speedier identification of genes from a database of very high number of data by manifold reduction of computational time. This pilot study gives promise for dealing gene search more efficiently by reducing search space thereby reducing time required.

Keywords: Searching, database, nucleotide, sequence

Cite this Article
Sarita Aggarwal, Tapobrata Lahiri, Ruchika Goyal. To Develop Efficient and Time Effective Search Model for Comparing Nucleotide Sequences with Database. Research & Reviews: A Journal of Bioinformatics. 2017; 4(2): 24–27p.