Research Repository (Delft University of Technology) · 2013 · 11 citations · 36 references
Open access
Life SciencesBioinformaticsComputer EngineeringComputational BiologyReconfigurable ComputingSequence AnalysisDna SequencingHardware AccelerationNucleic Acid SequencingReconfigurable AcceleratorsSequence AlignmentSequence Similarity SearchBiological Sequence AlignmentComputational Alignment AlgorithmsMatrix SimilarityScoring MatricesSequence Alignment ScoringSimilarity Matrix AnalysisSmith - Waterman AlgorithmSmith-waterman Algorithm
With the sequencing of DNA becoming cheaper and the resulting stack of data growing bigger, there is a big challenge for both engineer and biologist. Researchers are limited by their computational power. In this thesis, first an overview of sequence alignment algorithms will be given. Then a method to store the values of the similarity score matrix of the Smith-Waterman algorithm differentially will be presented. And finally, a description of the system approach used to design an accelerator, which implements this method, will be given. Implementation of the system design on an Artix-7 XC7A200T-2C FPGA, could lead to a total performance of 94 GCU/s. This is a speed up of 5x compared to conventional CPUs.
36
Basic local alignment search tool
Stephen F. Altschul, Warren Gish, Webb Miller et al. · Journal of Molecular Biology · 1990 · 94.5K citations
Initial sequencing and analysis of the human genome
Eric S. Lander, Lauren Linton, Bruce W. Birren et al. · Nature · 2001 · 24.6K citations · Full text