A parallel gibbs sampling algorithm for motif finding on GPU

Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009

Volumn , Issue , 2009, Pages 555-558

  Yu, Linbin ^a   Xu, Yun ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

CUDA; Gibbs sampling; GPGPU; Motif

Indexed keywords

BIOLOGICAL DATA; BIOLOGICAL SEQUENCES; COMPUTATIONAL CAPABILITY; CUDA; EXPERIMENTAL DATA; GENE TRANSCRIPTIONS; GIBBS SAMPLING; GPGPU; GRAPHICS PROCESSING UNIT; LOW-COST SOLUTION; MOTIF; MOTIF FINDING; RAPID GROWTH;

BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS EQUIPMENT; DISTRIBUTED PARAMETER NETWORKS; LEARNING ALGORITHMS; PROGRAM PROCESSORS; TRANSCRIPTION;

PARALLEL ALGORITHMS;

EID: 70449480713     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPA.2009.88     Document Type: Conference Paper

References (17)

1. Sinha S, Tompa M, A statistical method for finding transcription factor binding site. Proceedings of the Eighth International Conference on Intelligent Systems on Molecular Biology, San Diego, CA 2000:344-354.
2. Eskin E, Pevzner P, Finding composite regulatory patterns in DNA sequences. Bioinformatics 2002, 18(Suppl 1):S354-S363.
3. Pavesi G, Mauri G, Pesole G, An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics 2001, 17(Suppl 1):S207-S214.
4. Lawrence CE, Altschul SF, Boguski MS, Liu JS, Neuwald AF, Wootton JC, Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 1993, 262:208-214.
5. Lawrence CE, Reilly AA: An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins 1990, 7:41-51.
6. Buhler J, Tompa M, Finding motifs using random projections. J Comput Biol 2002, 9:225-242.
7. W. Liu, B. Schmidt, Voss G, Schroeder A, W. Muller-Wittig Bio-Sequence Database Scanning On GPU. In Proceeding of the 20th IEEE International Parallel & Distributed Processing Symposium: 2006
8. W. Liu, B. Schmidt, G. Voss and W. Müller-Wittig, GPU-clustalw: Using Graphics Hardware to Accelerate Multiple Sequence Alignment. in 13th Annual IEEE International Conference on High Performance Computing (HiPC 2006), LNCS 4297, 2006, pp. 363-374.
9. Svetlin A. Manavski and Giorgio Valle, CUDA Compatible GPU Cards as Efficient Hardware Accelerators for Smith-Waterman Sequence Alignment. BMC Bioinformatics 2008, 9(Suppl 2):S10
10. NVidia CUDA, http://www.nvidia.com/cuda
11. AMD CTM, http://ati.amd.com/products/streamprocessor/
12. Roth FP, Hughes JD, Estep PW, Church GM, Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation. Nature Biotechnology 1998, 16:939-945.
13. Thijs G, Marchal K, Moreau Y, A Gibbs sampling method to detect over-represented motifs in upstream regions of coexpressed genes. RECOMB 2001, 5:305-312.
14. Shida K, GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima. BMC Bioinformatics 2006, 7:486.
15. Park, S. K. and K. W., Miller, Random Number Generators: Good Ones are Hard to Find. Comm. ACM 31, 1192-1201 (1988).
16. R Eric, HC Timothy, rMotifGen: random motif generator for DNA and protein sequences. BMC Bioinformatics, 2007, 8: 292.
17. C Chen, B Schmidt, L Weiguo, W Müller-Wittig, Using Graphics Hardware to Accelerate Motif Finding in DNA Sequences. Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics, 2008: 448-459