2006 · 18 citations · 5 references
Life SciencesBioinformaticsComputer EngineeringComputational BiologyReconfigurable ComputingSequence AnalysisComputational GenomicsHardware AccelerationSequence AlignmentSequence Similarity SearchAccelerator MicroarchitectureAlignment OptimizationDatabase SearchingHomology SearchLocal AlignmentOptimal AlignmentSmith - Waterman AlgorithmSmith-waterman Algorithm
To infer homology and subsequently gene function, the Smith-Waterman algorithm is used to find the optimal local alignment between two sequences. When searching sequence databases that may contain billions of sequences, this algorithm becomes computationally expensive. Consequently, in this paper, we focused on accelerating the Smith-Waterman algorithm by modifying the computationally repeated portion of the algorithm by FPGA hardware custom instructions. These simple modifications accelerated the algorithm runtime by an average of 287% compared to the pure software implementation. Therefore, further design of FPGA accelerated hardware offers a promising direction to seeking runtime improvement of genomic database searching.
5
Basic local alignment search tool
Stephen F. Altschul, Warren Gish, Webb Miller et al. · Journal of Molecular Biology · 1990 · 94.5K citations
Basic Local Alignment Search Tool
Stephen F. Altschul · Journal of Molecular Biology · 1990 · 13.9K citations
Rapid and Sensitive Protein Similarity Searches
David J. Lipman, William R. Pearson · Science · 1985 · 4.1K citations
GeneTree: comparing gene and species phylogenies using reconciled trees.
Roderic Page · Bioinformatics · 1998 · 244 citations · Full text