High-performance implementation of planted motif problem on multicore and GPU

Concurrency and Computation: Practice and Experience

Volumn 25, Issue 10, 2013, Pages 1340-1355

  Dasari, Naga Shailaja ^a   Ranjan, Desh ^a   Zubair, Mohammad ^a  

^a Old Dominion University   (United States)

Author keywords

BitBased; DNA; GPU; multicore; parallel; PMP

Indexed keywords

DNA; GRAPHICS PROCESSING UNIT; TRANSCRIPTION;

BITBASED; COMPUTATIONAL BIOLOGY; HIGH PERFORMANCE IMPLEMENTATIONS; MEMORY REQUIREMENTS; MULTI CORE; PARALLEL; PHYLOGENETIC TREES; TRANSCRIPTION FACTOR BINDING SITES;

BINDING SITES;

EID: 84879416386     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.2935     Document Type: Article

References (17)

1. Modan KD, Ho-Kwok D,. A survey of DNA motif finding algorithms. BMC Bioinformatics 2007; 8 (S-7).
2. Pavel AP, Sing-Hoi S,. Combinatorial approaches to finding subtle signals in DNA sequences. In Intelligent Systems for Molecular Biology, 2000; 269-278.
3. Tieming J, Gopavarapu K, Desh R, Vasudevan B, Sengupta-Gopalan C, O'Connell M,. Tools for Cis-element recognition and phylogenetic tree construction based on conserved patterns. In Computers and Their Applications, 2007; 1-6.
4. Hertz GZ, Gary DS,. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 1999; 15 (7): 563-577. (Pubitemid 29462105)
5. Jeremy B, Martin T,. Finding motifs using random projections. Journal of Computational Biology 2002; 9 (2): 225-242.
6. Marie-France S,. Spelling approximate repeated or common motifs using a suffix tree. In Latin American Theoretical Informatics Symposium, 1998; 374-390.
7. Eleazar E, Pavel AP,. Finding composite regulatory patterns in DNA sequences. In Intelligent Systems for Molecular Biology, 2002; 354-363.
8. Jaime D, Sudha B, Sanguthevar R,. Fast and practical algorithms for planted (l,d) motif search. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2007; 23: 544-552.
9. Francis YLC, Henry CML,. Voting algorithms for discovering long motifs. In Asia-pacific Bioinformatics Conference, 2005; 261-271.
10. Nadia P, Alexandra MC, Laurent M, Marie-France S,. RISOTTO: fast extraction of motifs with mismatches. In Latin American Theoretical Informatics Symposium, 2006; 757-768.
11. Carvalho AM, Oliveira AL, Freitas AT, Sagot M,. A parallel algorithm for the extraction of structured motifs. In Proceedings of the 2004 ACM symposium on Applied Computing, 2004; 147-153.
12. Laurent M, Marie-France S,. Extracting structured motifs using a suffix tree-algorithms and application to promoter consensus identification. In Research in Computational Molecular Biology, 2000; 210-219.
13. Waterman MS, Arratia R, Galas DJ,. Pattern recognition in several sequences: consensus and alignment. Bulletin of Mathematical Biology 1984; 46: 515-527.
14. MESI Protocol. (Available from: http://software.intel.com/en-us/articles/ mesi-protocol).
15. Sanguthevar R, Sudha B, Chun-Hsi H,. Exact Algorithms for planted motif problems. Journal of Computational Biology 2005; 12 (8): 1117-1128.
16. CUDA Programming Guide. (Available from: http://developer.download. nvidia.com/compute/cuda/2-0/docs/NVIDIA-CUDA-Programming-Guide-2.0.pdf).
17. Naga Shailaja D, Ranjan D, Zubair M,. Solving planted motif problem on GPU. In GPUScA, 2010.