Accelerating motif discovery: Motif matching on parallel hardware

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4175 LNBI, Issue , 2006, Pages 197-206

  Sandve, Geir Kjetil ^a   Nedland, Magnar ^b   Syrstad, Øyvind B Ø ^a   Eidsheim, Lars Andreas ^a   Abul, Osman ^a   Drabløs, Finn ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b Interagon AS Laboratoriesenteret Medisinsk Teknisk Senter   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER HARDWARE; PARALLEL PROCESSING SYSTEMS; SUPERCOMPUTERS;

CELL-CYCLE REGULATED GENES; MOTIF DISCOVERY METHODS; PARALLEL ACCELERATION OF MOTIF MATCHING (PAMM); PARALLEL VERSIONS;

PATTERN MATCHING;

EID: 33750387399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11851561_19     Document Type: Conference Paper

References (11)

1. Bailey, T.L., Elkan, C.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proc. Conf. Intell. Syst. Mol. Biol. ISMB'94 (1994) 28-36
2. Grundy, W.N., Bailey, T.L., Elkan, C.P.: ParaMEME: a parallel implementation and a web interface for a DNA and protein motif discovery tool. Comput. Appl. Biosci. 12 (1996) 303-310
3. Yamaguchi, Y., Miyajima, Y., Maruyama, T., Konagaya, A.: High speed homology search using run-time reconfiguration. LNCS. Volume 2438. (2002) 281-291
4. Oliver, T., Schmidt, B., Nathan, D., Clemens, R., Maskell, D.: Using reconfigurable hardware to accelerate multiple sequence alignment with ClustalW. Bioinformatics 21(16) (2005) 3431-3432
5. Mak, T.S.T., Lam, K.P.: Embedded computation of maximum-likelihood phylogeny inference using platform FPGA. In Proc. Comput. Systems Bioinformatics Conf. CSB'04, IEEE. (2004) 512-514
6. Halaas, A., Svingen, B., Nedland, M., Saetrom, P., Snøve Jr., O., Birkeland, O.R.: A recursive MISD architecture for pattern matching. IEEE Trans. Very Large Scale Integr. Syst. 12(7) (2004) 727-734
7. Marsan, L., Sagot, M.F.: Extracting structured motifs using a suffix tree-algorithms and application to promoter consensus identification. In: Proc. 4th Int'l Conf. Comput. Mol. Bio. RECOMB'00, ACM Press (2000) 210-219
8. Blanchette, M., Tompa, M.: Discovery of regulatory elements by a computational method for phylogenetic footprinting. Genome Res. 12(5) (2002) 739-748
9. Sinha, S., Tompa, M.: YMF: A program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res. 31(13) (2003) 3586-3588
10. Bortoluzzi, S., Coppe, A., Bisognin, A., Pizzi, C., Danieli, G.: A multistep bioinformatic approach detects putative regulatory elements in gene promoters. BMC Bioinformatics 6(1) (2005) 121
11. Lawrence, C.E., Reilly, A.A.: An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins 7(1) (1990) 41-51