Pairwise sequence alignment for very long sequences on GPUs
暂无分享,去创建一个
[1] Alba Cristina Magalhaes Alves de Melo,et al. Local DNA sequence alignment in a cluster of workstations: Algorithms and tools , 2010, Journal of the Brazilian Computer Society.
[2] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.
[3] Changjun Wu,et al. pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs , 2012, IEEE Transactions on Parallel and Distributed Systems.
[4] Thomas L. Madden,et al. BLAST 2 Sequences, a new tool for comparing protein and nucleotide sequences. , 1999, FEMS microbiology letters.
[5] D. Higgins,et al. See Blockindiscussions, Blockinstats, Blockinand Blockinauthor Blockinprofiles Blockinfor Blockinthis Blockinpublication Clustal: Blockina Blockinpackage Blockinfor Blockinperforming Multiple Blockinsequence Blockinalignment Blockinon Blockina Minicomputer Article Blockin Blockinin Blockin , 2022 .
[6] Kun-Mao Chao,et al. A local alignment tool for very long DNA sequences , 1995, Comput. Appl. Biosci..
[7] S. B. Needleman,et al. A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.
[8] Ayman Khalafallah,et al. Optimizing Smith-Waterman algorithm on Graphics Processing Unit , 2010, 2010 2nd International Conference on Computer Technology and Development.
[9] Giorgio Valle,et al. CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment , 2008, BMC Bioinformatics.
[10] E. Myers,et al. Basic local alignment search tool. , 1990, Journal of molecular biology.
[11] T. R. P. Siriwardena,et al. Accelerating global sequence alignment using CUDA compatible multi-core GPU , 2010, 2010 Fifth International Conference on Information and Automation for Sustainability.
[12] Witold R. Rudnicki,et al. An efficient implementation of Smith Waterman algorithm on GPU using CUDA, for massively parallel scanning of sequence databases , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[13] W. Pearson. Comparison of methods for searching protein sequence databases , 1995, Protein science : a publication of the Protein Society.
[14] W. Pearson. Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. , 1991, Genomics.
[15] David A. Bader. Designing Scalable Synthetic Compact Applications for Benchmarking High Productivity Computing Systems , 2006 .
[16] Yongchao Liu,et al. CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions , 2010, BMC Research Notes.
[17] Bin Ma,et al. PatternHunter II: highly sensitive and fast homology search. , 2003, Genome informatics. International Conference on Genome Informatics.
[18] Stephen W. Poole,et al. Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors , 2010, J. Comput. Phys..
[19] Bin Ma,et al. PatternHunter: faster and more sensitive homology search , 2002, Bioinform..
[20] Srinivas Aluru,et al. Parallel Syntenic Alignments , 2003, Parallel Process. Lett..
[21] O. Gotoh. An improved algorithm for matching biological sequences. , 1982, Journal of molecular biology.
[22] D. Lipman,et al. Rapid and sensitive protein similarity searches. , 1985, Science.
[23] Eugene W. Myers,et al. Optimal alignments in linear space , 1988, Comput. Appl. Biosci..
[24] S. Salzberg,et al. Alignment of whole genomes. , 1999, Nucleic acids research.
[25] E. G. Shpaer,et al. Sensitivity and selectivity in protein similarity searches: a comparison of Smith-Waterman in hardware to BLAST and FASTA. , 1996, Genomics.