|
[1] Stephen F. Altschul, Warren Gish, Webb Miller, Eugene W. Myers, and David J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215(3):403 – 410, 1990. [2] Benjamin Buchfink, Chao Xie, and Daniel H Huson. Fast and sensitive protein alignment using diamond. Nature methods, 12(1):59, 2015. [3] Paolo Ferragina and Giovanni Manzini. Opportunistic data structures with applications. In Foundations of Computer Sci- ence, 2000. Proceedings. 41st Annual Symposium on, pages 390– 398. IEEE, 2000. [4] Osamu Gotoh. An improved algorithm for matching biological sequences. Journal of Molecular Biology, 162(3):705 – 708, 1982. [5] Daniel H. Huson and Chao Xie. A poor man’s blastx—high- throughput metagenomic protein database search using pauda. Bioinformatics, 30(1):38–39, 2014. [6] Ali Khajeh-Saeed, Stephen Poole, and J. Blair Perot. Accelera- tion of the Smith–Waterman Algorithm Using Single and Mul- 31 tiple Graphics Processors. Journal of Computational Physics, 229(11):4247–4258, 2010. [7] Chi-Man Liu, Thomas Wong, Edward Wu, Ruibang Luo, Siu- Ming Yiu, Yingrui Li, Bingqiang Wang, Chang Yu, Xiaowen Chu, Kaiyong Zhao, Ruiqiang Li, and Tak-Wah Lam. Soap3: ultra-fast gpu-based parallel alignment tool for short reads. Bioinformatics, 28(6):878–879, 2012. [8] Weiguo Liu, Bertil Schmidt, Gerrit Voss, and Wolfgang Mu ̈ller- Wittig. Gpu-clustalw: Using graphics hardware to accelerate multiple sequence alignment. In Yves Robert, Manish Parashar, Ramamurthy Badrinath, and Viktor K. Prasanna, editors, High Performance Computing - HiPC 2006, pages 363–374, Berlin, Heidelberg, 2006. Springer Berlin Heidelberg. [9] Yongchao Liu, Adrianto Wirawan, and Bertil Schmidt. Cu- dasw++ 3.0: accelerating smith-waterman protein database search by coupling cpu and gpu simd instructions. BMC Bioin- formatics, 14(1):117, Apr 2013. [10] Huijun Mai, Dinghua Li, Yifan Zhang, Henry Chi-Ming Le- ung, Ruibang Luo, Hing-Fung Ting, and Tak-Wah Lam. Ac- diamond: Accelerating protein alignment via better simd par- allelization and space-efficient indexing. In Francisco Ortun ̃o and Ignacio Rojas, editors, Bioinformatics and Biomedical En- gineering, pages 426–433, Cham, 2016. Springer International Publishing. 32 [11] Torbjørn Rognes. Faster smith-waterman database searches with inter-sequence SIMD parallelisation. BMC Bioinformat- ics, 12(1):221, Jun 2011. [12] Torbjørn Rognes and Erling Seeberg. Six-fold speed-up of Smith–Waterman sequence database searches using parallel pro- cessing on common microprocessors. Bioinformatics, 16(8):699– 706, 2000. [13] T.F. Smith and M.S. Waterman. Identification of com- mon molecular subsequences. Journal of Molecular Biology, 147(1):195 – 197, 1981. [14] Shuji Suzuki, Masanori Kakuta, Takashi Ishida, and Yutaka Akiyama. Ghostx: An improved sequence homology search al- gorithm using a query suffix array and a database suffix array. PLOS ONE, 9(8):1–8, 08 2014. [15] Jia Yu, Jochen Blom, Alexander Sczyrba, and Alexander Goes- mann. Rapid protein alignment in the cloud: Hamond combines fast diamond alignments with hadoop parallelism. Journal of Biotechnology, 257:58 – 60, 2017. Dedicated to Prof. Dr. Alfred Pu ̈hler on the occasion of his 75th birthday. [16] J. Zhang, H. Wang, and W. c. Feng. cublastp: Fine-grained par- allelization of protein sequence search on cpu+gpu. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 14(4):830–843, July 2017. [17] Yongan Zhao, Haixu Tang, and Yuzhen Ye. Rapsearch2: a fast 33 and memory-efficient protein similarity search tool for next- generation sequencing data. Bioinformatics, 28(1):125–126, 2012. |