STM Journals Peer-reviewed research from Consortium e-Learning Network

Research & Reviews: A Journal of Bioinformatics

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

  1. Sarita Aggarwal
  2. Tapobrata Lahiri
  3. Ruchika Goyal

Abstract

AbstractSearching 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, sequenceCite this ArticleSarita 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.

References (15)

  1. Mount DM. Bioinformatics: Sequence and Genome Analysis, 2nd edition. Cold Spring Harbor, NY: Cold Spring Harbor Laboratory Press; 2004.
  2. Needleman SB, Wunsch CD. A General method applicable to the search for similarities in the amino acid seq uence of two proteins. J Mol Biol. 1970; 48(3): 443-53.
  3. Smith TF, Waterman MS. Identification of common molecular subsequences. J Mol Biol. 1981; 47: 195–197.
  4. Lipman DJ, Pearson WR. Rapid and sensitive protein similarity search. Science. 1985; 227 (4693): 1435-41.
  5. Altschul SF, Gish W, Miller W, Myers Development of efficient and time effective search model Aggarwal et al. RRJoBI (2017) 24-27 © STM Journals 2017. All Rights Reserved Page 27 EW, Lipman DJ. Basic local alignment search tool. J Mol Biol . 1990; 215(3), 403–410.
  6. Casey RM . BLAST sequences aid in genomics and proteomics. 2007
  7. Duran C, Appleby N, Vardy M, Edwards D, Batley J. Single nu cleotide polymorphism discovery in barley using autoSN Pdb. Plant Biotechnol. J . 2009; 7 (4):326-33.
  8. http://biovisionindia.org/magazine/biotech nology-topics/sequence-alignment- bioinformatics/
  9. Blaisdell BE. A measure of the similarity of sets of sequences not requiring sequence alignment. Proc. Natl. Acad. Sci USA. 1986; 83: 5155–5159.
  10. Petrilli P . Classification of protein sequences by their dipeptide composition . Comput. Appl. Biosci. 1993; 9: 205–209.
  11. Wu TJ, Burke JP, Davison DB. A measure of DNA sequence di ssimilarity based on Mahalanobis distance between frequencies of words. Biometrics. 1997; 53, 1431 – 1439.
  12. Pevzner PA . Statistical distance between texts and filtration methods in sequence comparison. Comput. Appl. Biosci . 1992; 8: 121–127.
  13. Evaluating the si gnificance of Global and Local features in Expressed Sequence Tag: A clustering Quality perspective. Proceedings of the International Multiconference of engineers and computer Scientists 2009 Vol I IMECS 2009, Hong Kong.
  14. Otu HH, K Sayood . A new sequence distance measure for phylogenetic tree construction. Bioinformatics. 2003; 19(16): 2122–2130.
  15. Matlab Bioinformatics Toolbox - Functions-pair wise sequence alignment. 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.
Support