%0 Journal Article %1 yuvabharathir2013increasing %A Yuva Bharathi.R, Jebaraj Jegan.T %A Punitha.P, %D 2013 %E and Fabricio Moraes de Almeida, %J SCIENCE PARK %K Biological Comparing Computation Sequence Significance Time. Word-matching %N 9 %T Increasing Efficiency of Computation Time For Hit Detection In BLASTN %U http://www.scienceparks.in/ArticlePDF/26.pdf %V 1 %X For biologists very hard time is with analyzing the uniqueness between two sample sequences such as DNA, RNA and protein sequences. A Bio-sequence represents a single, continuous molecule of nucleic acid or protein. It can be anything from a band on a gel to a complete chromosome. That's to design for a huge database system which finds similarities between two sequences that have biological significance. In such condition we have to compromise in computation time, this can be overcome through implementation BLASTN process. In this paper the BLAST process will be working more efficient by a new approach for biological sequence database scanning. The scanning is performed with reconfigurable FPGA base hardware by comparing sequence one to many sequences from the database. The experimental sequence matching reduces the computation time of BLAST. 1 2

@article{yuvabharathir2013increasing, abstract = {For biologists very hard time is with analyzing the uniqueness between two sample sequences such as DNA, RNA and protein sequences. A Bio-sequence represents a single, continuous molecule of nucleic acid or protein. It can be anything from a band on a gel to a complete chromosome. That's to design for a huge database system which finds similarities between two sequences that have biological significance. In such condition we have to compromise in computation time, this can be overcome through implementation BLASTN process. In this paper the BLAST process will be working more efficient by a new approach for biological sequence database scanning. The scanning is performed with reconfigurable FPGA base hardware by comparing sequence one to many sequences from the database. The experimental sequence matching reduces the computation time of BLAST. [1] [2] }, added-at = {2014-08-15T12:15:35.000+0200}, author = {Yuva Bharathi.R, Jebaraj Jegan.T and Punitha.P}, biburl = {https://www.bibsonomy.org/bibtex/29c65815042622ae86d2f82a2e8a9631d/sciencejournal}, editor = {and Fabricio Moraes de Almeida}, interhash = {d2661ea3041b4eb3307a478c425b47cf}, intrahash = {9c65815042622ae86d2f82a2e8a9631d}, journal = { SCIENCE PARK}, keywords = {Biological Comparing Computation Sequence Significance Time. Word-matching}, month = {September}, number = 9, timestamp = {2014-08-15T12:15:35.000+0200}, title = {Increasing Efficiency of Computation Time For Hit Detection In BLASTN}, url = {http://www.scienceparks.in/ArticlePDF/26.pdf}, volume = 1, year = 2013 }