(35.171.164.77)
[ij] [ij] [ij] 
Email id
 

Asian Journal of Research in Social Sciences and Humanities
Year : 2016, Volume : 6, Issue : 4
First page : ( 316) Last page : ( 329)
Online ISSN : 2249-7315.
Article DOI : 10.5958/2249-7315.2016.00091.5

A reconfigurable approach for Dnasequencing and Searching methods

Surendar A.1, Arun M.2, Kavitha M.3

1Research Scholar, Anna university, Chennai, India

2School of Electronics Engineering, VIT University, Vellore, India

3Departmrnt of ECE, AVS College of Technology, India

Online published on 5 April, 2016.

Abstract

DNA database are increasing in day by day. The DNA sequences comparison is used for classification of species, finding heredity and disease detection. This similarity search for identify similarities between subsequences of strings is called as sequence alignment. Gene sequence alignment is a tough task in bioinformatics due to huge data and high searching time. Researchers have used various bioinformatics algorithms for sequencing but it takes enormous amount of time for computations. The bloom filter which is commonly used for searching in Intrusion Detection System (IDS) is proposed with FPGA to overcome the space and time complexity problems in bioinformatics FPGAs have high-performance computing accelerators and their reprogramming ability allows different algorithms to be implemented using the same hardware. For realizing the biological mysteries to meet the necessary requirements such as time, memory and speed, an efficient searching methodshas been used and compared with FPGA.

Top

Keywords

Bioinformatics, Gene Sequence Alignment, Search Algorithms, Bloom Filter, FPGA.

Top

  
║ Site map ║ Privacy Policy ║ Copyright ║ Terms & Conditions ║ Page Rank Tool
815,573,144 visitor(s) since 30th May, 2005.
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.