STEME: Efficient em to find motifs in large data sets

Nucleic Acids Research

Volumn 39, Issue 18, 2011, Pages

  Reid, John E ^a   Wernisch, Lorenz ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANALYTIC METHOD; ARTICLE; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; PREDICTION; PRIORITY JOURNAL; PROBABILITY; PROTEIN MOTIF; QUALITY CONTROL; SUFFIX TREE EM FOR MOTIF ELICITATION ALGORITHM; THEORETICAL STUDY;

ALGORITHMS; BINDING SITES; NUCLEOTIDE MOTIFS; REPRODUCIBILITY OF RESULTS; SEQUENCE ANALYSIS, DNA; TRANSCRIPTION FACTORS;

EID: 80054070341     PISSN: 03051048     EISSN: 13624962     Source Type: Journal    
DOI: 10.1093/nar/gkr574     Document Type: Article

References (42)

1. Park, P.J. (2009) ChIP-seq: advantages and challenges of a maturing technology. Nat. Rev. Genet., 10, 669-680.
2. Liu, X.S. and Meyer, C.A. (2009) ChIP-Chip: algorithms for calling binding sites. Methods Mol. Biol., 556, 165-175.
3. Southall, T.D. and Brand, A.H. (2007) Chromatin profiling in model organisms. Brief. Funct. Genomic Proteomic, 6, 133-140. (Pubitemid 351721076)
4. Gilchrist, D.A., Fargo, D.C. and Adelman, K. (2009) Using ChIP-chip and ChIP-seq to study the regulation of gene expression: genome-wide localization studies reveal widespread regulation of transcription elongation. Methods, 48, 398-408.
5. Reid, J.E., Ott, S. and Wernisch, L. (2009) Transcriptional programs: modelling higher order structure in transcriptional control. BMC Bioinformatics, 10, 218.
6. Hu, J., Li, B. and Kihara, D. (2005) Limitations and potentials of current motif discovery algorithms. Nucleic Acids Res., 33, 4899-4913. (Pubitemid 41418889)
7. MacIsaac, K.D. and Fraenkel, E. (2006) Practical strategies for discovering regulatory DNA sequence motifs. PLoS Comput. Biol., 2, e36.
8. D'haeseleer, P. (2006) How does DNA sequence motif discovery work? Nat. Biotechnol., 24, 959-961.
9. Das, M.K. and Dai, H.-K. (2007) A survey of DNA motif finding algorithms. BMC Bioinformatics, 8(Suppl. 7), S21.
10. Dempster, A.P., Laird, N.M. and Rubin, D.B. (1977) Maximum likelihood from incomplete data via the EM Algorithm. J. Roy. Stat. Soc. Ser. B, 39, 1-38.
11. Geman, S. and Geman, D. (1993) Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. J. Appl. Stat., 20, 25-62.
12. Lawrence, C.E. and Reilly, A.A. (1990) An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins, 7, 41-51. (Pubitemid 20102601)
13. Bailey, T.L. and Elkan, C. (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers, Proc. Int. Conf. Intell. Syst. Mol. Biol., 2, 28-36.
14. Blekas, K., Fotiadis, D.I. and Likas, A. (2003) Greedy mixture learning for multiple motif discovery in biological sequences. Bioinformatics, 19, 607-617. (Pubitemid 36417055)
15. Prakash, A., Blanchette, M., Sinha, S. and Tompa, M. (2004) Motif discovery in heterogeneous sequence data. Pac. Symp. Biocomput., 1, 348-359.
16. Sinha, S., Blanchette, M. and Tompa, M. (2004) PhyME: a probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinformatics, 5, 170.
17. Moses, A.M., Chiang, D.Y. and Eisen, M.B. (2004) Phylogenetic Motif Detection by Expectation Maximization on Evolutionary Mixtures. Pac. Symp. Biocomput., 324-335.
18. Qi, Y., Ye, P. and Bader, J.S. (2005) Genetic interaction motif finding by expectation maximization-a novel statistical model for inferring gene modules from synthetic lethality. BMC Bioinformatics, 6, 288.
19. MacIsaac, K.D., Gordon, D.B., Nekludova, L., Odom, D.T., Schreiber, J., Gifford, D.K., Young, R.A. and Fraenkel, E. (2006) A hypothesis-based approach for identifying the binding specificity of regulatory proteins from chromatin immunoprecipitation data. Bioinformatics, 22, 423-429. (Pubitemid 43231416)
20. Li, L. (2009) GADEM: a genetic algorithm guided formation of spaced dyads coupled with an EM algorithm for motif discovery. J. Comput. Biol., 16, 317-329.
21. Tompa, M., Li, N., Bailey, T.L., Church, G.M., Moor, B.D., Eskin, E., Favorov, A.V., Frith, M.C., Fu, Y., Kent, W.J. et al. (2005) Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol., 23, 137-144. (Pubitemid 41724640)
22. Grundy, W.N., Bailey, T.L. and Elkan, C.P. (1996) ParaMEME: a parallel implementation and a web interface for a DNA and protein motif discovery tool. Comput. Appl. Biosci., 12, 303-310.
23. Sandve, G.K., Nedland, M., Syrstad, Ø.B., Eidsheim, L.A., Abul, O. and Drabløs, F. (2006) Workshop on Algorithms in Bioinformatics (WABI)'06, pp. 197-206.
24. Chen, C., Schmidt, B., Weiguo, L., and Müller-Wittig, W. (2008) GPU-MEME: Using Graphics Hardware to Accelerate Motif Finding in DNA Sequences. In Chetty, M., Ngom, A., and Ahmad, S., (eds), Pattern Recognition in Bioinformatics, Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, pp. 448-459.
25. Gusfield, D. (1997) Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge UK.
26. Schatz, M., Trapnell, C., Delcher, A. and Varshney, A. (2007) High-throughput sequence alignment using Graphics Processing Units. BMC Bioinformatics, 8, 474.
27. Phoophakdee, B. and Zaki, M.J. (2008) In 13th Pacific Symposium on Biocomputing. World Scientific Publishing Company, pp. 90-101.
28. Mäkinen, V., Välimäki, N., Laaksonen, A., and Katainen, R. (2010) Unified view of backward backtracking in short read mapping. In Elomaa, T., Mannila, H., and Orponen, P. (eds), Algorithms and Applications, Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, pp. 182-195.
29. Federico, M. and Pisanti, N. (2009) Suffix tree characterization of maximal motifs in biological sequences. Theor. Comput. Sci., 410, 4391-4401.
30. Marsan, L. and Sagot, M.F. (2000) Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comput. Biol., 7, 345-362.
31. Pavesi, G., Mauri, G. and Pesole, G. (2001) An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics, 17(Suppl. 1), S207-S214. (Pubitemid 33793512)
32. Beckstette, M., Homann, R., Giegerich, R. and Kurtz, S. (2006) Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics, 7, 389.
33. Ukkonen, E. (1995) On-line construction of suffix trees. Algorithmica, 14, 249-260.
34. Döring, A., Weese, D., Rausch, T. and Reinert, K. (2008) SeqAn an efficient, generic C++library for sequence analysis. BMC Bioinformatics, 9, 11.
35. Reid, J.E., Evans, K.J., Dyer, N., Wernisch, L. and Ott, S. (2010) Variable structure motifs for transcription factor binding sites. BMC Genomics, 11, 30.
36. Birney, E., Stamatoyannopoulos, J.A., Dutta, A., Guigó , R., Gingeras, T.R., Margulies, E.H., Weng, Z., Snyder, M., Dermitzakis, E.T., Thurman, R.E. et al. (2007) Identification and analysis of functional elements in 1 the encode pilot project. Nature, 447, 799-816. (Pubitemid 46920138)
37. Liao, W., Schones, D.E., Oh, J., Cui, Y., Cui, K., Roh, T.-Y., Zhao, K. and Leonard, W.J. (2008) Priming for T helper type 2 differentiation by interleukin 2-mediated induction of interleukin 4 receptor alpha-chain expression. Nat. Immunol., 9, 1288-1296.
38. Cawley, S., Bekiranov, S., Ng, H.H., Kapranov, P., Sekinger, E.A., Kampa, D., Piccolboni, A., Sementchenko, V., Cheng, J., Williams, A.J. et al. (2004) Unbiased mapping of transcription factor binding sites along human chromosomes 21 and 22 points to widespread regulation of noncoding RNAs. Cell, 116, 499-509. (Pubitemid 38264428)
39. Valouev, A., Johnson, D.S., Sundquist, A., Medina, C., Anton, E., Batzoglou, S., Myers, R.M. and Sidow, A. (2008) Genome-wide analysis of transcription factor binding sites based on ChIP-Seq data. Nat. Methods, 5, 829-834.
40. Robertson, G., Hirst, M., Bainbridge, M., Bilenky, M., Zhao, Y., Zeng, T., Euskirchen, G., Bernier, B., Varhol, R., Delaney, A. et al. (2007) Genome-wide profiles of STAT1 DNA association using chromatin immunoprecipitation and massively parallel sequencing. Nat. Methods, 4, 651-657. (Pubitemid 47202477)
41. Ji, H., Jiang, H., Ma, W., Johnson, D.S., Myers, R.M. and Wong, W.H. (2008) An integrated software system for analyzing ChIP-chip and ChIP-seq data. Nat. Biotechnol., 26, 1293-1300, Nov.
42. Bailey, T.L. and Elkan, C. (1995) Unsupervised Learning of Multiple Motifs In Biopolymers Using EM. Mach. Learn., 51-80.