• Corpus ID: 212550458

High Speed Reconfigurable Accelerator for Word Matching Stage of Blast In

@inproceedings{Swathi2017HighSR,
  title={High Speed Reconfigurable Accelerator for Word Matching Stage of Blast In},
  author={Raparla Swathi and V. K. Kumar},
  year={2017}
}
BLAST (basic local alignment search tool) is one of the most popular sequence analysis tools used by molecular biologists. It is designed to efficiently find similar regions between two sequences that have biological significance. Because the genomic databases size is growing rapidly, when performing a complete genomic database search of the computation time of BLAST, it is continuously increasing. There is a clear need to accelerate this process, In this paper, we present a new approach for… 

Figures from this paper

References

SHOWING 1-4 OF 4 REFERENCES

FPGA based architecture for DNA sequence comparison and database search

TLDR
The new architecture for the BLAST algorithm was fully designed, placed and routed, and the post place-and-route cycle-accurate simulation shows a better performance than a cluster of workstations running highly optimized code over identical datasets.

Biosequence Similarity Search on the Mercury System

TLDR
The design ofBLASTN, the version of BLAST that searches DNA sequences, on the Mercury system, an architecture that supports high-volume, high-throughput data movement off a data store and into reconfigurable hardware.

A Greedy Algorithm for Aligning DNA Sequences

TLDR
A new greedy alignment algorithm is introduced with particularly good performance and it is shown that it computes the same alignment as does a certain dynamic programming algorithm, while executing over 10 times faster on appropriate data.

Efficient Hardware Hashing Functions for High Performance Computers

TLDR
It is shown that, by choosing hashing functions at random from a particular class, called H/sub 3/, of hashing functions, the analytical performance of hashing can be achieved in practice on real-life data.