Genomic Data Clustering on FPGAs for Compression
- First Online:
Current sequencing machine technology generates very large and redundant volumes of genomic data for each biological sample. Today data and associated metadata are formatted in very large text file assemblies called FASTQ carrying the information of billions of genome fragments referred to as “reads” and composed of strings of nucleotide bases with lengths in the range of a few tenths to a few hundreds bases. Compressing such data is definitely required in order to manage the sheer amount of data soon to be generated. Doing so implies finding redundant information in the raw sequences. While most of it can be mapped onto the human reference genome and fits well for compression, about 10% of it usually does not map to any reference . For these orphan sequences, finding redundancy will help compression. Doing so requires clustering these reads, a very time consuming process. Within this context this paper presents a FPGA implementation of a clustering algorithm for genomic reads, implemented on Pico Computing EX-700 AC-510 hardware, offering more than a \(1000\times \) speed up over a CPU implementation while reducing power consumption by a 700 factor.
- 5.Hussain, H.M., Benkrid, K., Seker, H., Erdogan, A.T.: FPGA implementation of k-means algorithm for bioinformatics application: an accelerated approach to clustering microarray data. In: 2011 NASA/ESA Conference on Adaptive Hardware and Systems (AHS), pp. 248–255, June 2011Google Scholar
- 8.Pollard, K.S., van der Laan, M.J.: Bioinformatics and computational biology solutions using R and bioconductor. In: Gentleman, R., Carey, V.J., Huber, W., Irizarry, R.A., Dudoit, S. (eds.) Cluster Analysis of Genomic Data, pp. 209–228. Springer, New York (2005)Google Scholar
- 10.Winterstein, F., Bayliss, S., Constantinides, G.A.: FPGA-based k-means clustering using tree-based data structures. In: 23rd International Conference on Field programmable Logic and Applications. pp. 1–6, September 2013Google Scholar