Comparison of optimization techniques for sequence pattern discovery by maximum-likelihood

Pattern Recognition Letters

Volumn 31, Issue 14, 2010, Pages 2147-2160

  Bi, Chengpeng ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Expectation maximization (EM); Gene regulation; Markov chain Monte Carlo; Maximum likelihood; Motif discovery; Multiple local alignment

Indexed keywords

EXPECTATION MAXIMIZATION; GENE REGULATION; LOCAL ALIGNMENT; MARKOV CHAIN MONTE CARLO; MOTIF DISCOVERY;

ALGORITHMS; ALIGNMENT; COMPUTER SIMULATION; DNA SEQUENCES; GENES; MARKOV PROCESSES; MAXIMUM PRINCIPLE; MONTE CARLO METHODS; OPTIMIZATION; STOCHASTIC SYSTEMS;

MAXIMUM LIKELIHOOD;

EID: 77956339979     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2009.09.005     Document Type: Article

References (56)

1. Alberts, B., Johnson, J., Lewis, J., Raff, M., Roberts, K., Walter, P., 2002. Molecular Biology of the Cell, fourth ed. Garland, New York.
2. T.L. Bailey, and C. Elkan Fitting a mixture model by expectation maximization to discover motifs in biopolymers Proc. Second Internat. Conf. on Intelligent Systems for Molecular Biology 1994 AAAI Press Menlo Park, California 28 36
3. T.L. Bailey, and C. Elkan Unsupervised learning of multiple motifs in biopolymers using expectation maximization Machine Learn. 21 1995 51 80
4. O. Bembom, S. Keles, and M.J. van der Laan Supervised detection of conserved motifs in DNA sequences with cosmo Statist. Appl. Genet. Mol. Biol. 2006 6 Article 8
5. O.G. Berg, and P.H. von Hippel Selection of DNA binding sites by regulatory proteins: Statistical-mechanical theory and application to operators and promoters J. Mol. Biol. 193 1987 723 750
6. C.-P. Bi SEAM: A stochastic EM-type algorithm for motif-finding in biopolymer sequences J. Bioinform. Comput. Biol. 5 2007 47 77
7. Bi, C.-P., 2007. A genetic-based EM motif-finding algorithm for biological sequence analysis. In: Proc. IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2007, pp. 275-282.
8. Bi, C.-P., 2008. Evolutionary Metropolis sampling in sequence alignment space. Proc. 2008 IEEE Congress on Evolutionary Computation (CEC), 08, pp. 189-194.
9. C.-P. Bi A Monte Carlo EM algorithm for de novo motif discovery in biomolecular sequences IEEE Trans. Comput. Biol. Bioinform. 6 2009 370 386
10. C.-P. Bi DNA motif alignment through evolving a population of Markov chains BMC Bioinform. 10 2009 S13
11. G. Celeux, and J. Diebolt Stochastic versions of the EM algorithm: An experimental study in the mixture case J. Statist. Comput. Simul. 55 1996 287 314
12. B. Delyon, M. Lavielle, and E. Moulines Convergence of a stochastic approximation version of the EM algorithm Ann. Statist. 27 1999 94 128
13. A.P. Dempster, A.M. Laird, and D.B. Rubin Maximum likelihood from incomplete data via the EM algorithm (with discussion) J. Royal Statist. Soc. B 39 1977 1 38
14. The ENCODE project consortium: Identification and analysis of functional elements in 1% of the human genome by the ENCODE pilot project. 2007. Science 447, 799-816.
15. C. Fraley, and A. Raftery Model-based clustering, discriminant analysis, and density estimation J. Amer. Statist. Assoc. 97 2002 611 631
16. M.C. Frith, U. Hansen, J.L. Spouge, and Z. Weng Finding functional sequence elements by multiple local alignment Nucl. Acids Res. 32 2004 189 200
17. S. Geman, and D. Geman Stochastic relaxation, Gibbs distribution and Bayesian restoration of images IEEE Trans. Pattern Anal. Machine Intell. 6 1984 721 741
18. C.T. Harbison, D.B. Gordon, T.I. Lee, N.J. Rinaldi, K.D. MacIsaac, T.W. Danford, N.M. Hannett, J.-B. Tagne, D.B. Reynolds, J. Yoo, E.G. Jennings, J. Zeitlinger, D.K. Pokholok, M. Kellis, P.A. Rolfe, K.T. Takusagawa, E.S. Lander, D.K. Gifford, E. Fraenkel, and R.A. Young Transcriptional regulatory code of a eukaryotic genome Nature 431 2004 99 104
19. W.K. Hastings Monte Carlo sampling methods using Markov chains and their applications Biometrika 57 1970 97 109
20. J.H. Holland Adaptation in Natural and Artificial Systems 1992 MIT Press Cambridge, MA
21. C.H. Holloman, H.K.H. Lee, and D.M. Higdon Multi-resolution genetic algorithms and Markov chain Monte Carlo J. Comput. Graphical Statist. 15 2006 861 879
22. S.T. Jensen, X.S. Liu, Q. Zhou, and J.S. Liu Computational discovery of gene regulatory binding motifs: A Bayesian perspective Statist. Sci. 19 2004 188 204
23. H. Ji, and W.W. Wong Computational biology: Towards deciphering gene regulatory information in mammalian genomes Biometrics 62 2006 645 663
24. D.S. Johnson, A. Mortazavi, R.M. Myers, and B. Wold Genome-wide mapping of in vivo protein-DNA interactions Science 316 2007 1497 1502
25. S. Keles, M.J. van der Laan, S. Dudoit, B. Xing, and M.B. Eisen Supervised detection of regulatory motifs in DNA sequences Statist. Appl. Genet. Mol. Biol. 2 2003 5
26. S. Kullback, and R.A. Leibler On information and sufficiency Ann. Math. Statist. 22 1951 79 86
27. C.E. Lawrence Detecting subtle sequence signals: A gibbs sampling strategy for multiple alignment Science 262 1993 208 214
28. C.E. Lawrence, and A.A. Reilly An expectation maximization algorithm for the identification and characterization of common sites in unaligned biopolymer sequences Proteins: Struct. Funct. Genet. 7 1990 41 51
29. F. Liang, and W.H. Wong Evolutionary Monte Carlo for protein folding simulations J. Chem. Phys. 115 2001 3374 3380
30. J.S. Liu The collapsed Gibbs sampler with applications to a gene regulation problem J. Amer. Statist. Assoc. 89 1994 958 966
31. J.S. Liu Bayesian modeling and computation in bioinformatics research T. Jiang, Y. Xu, M. Zhang, Current Topics in Computational Biology 2002 MIT Press 11 44
32. J.S. Liu Monte Carlo Strategies in Scientific Computing 2002 Springer-Verlag New York
33. J.S. Liu, A.F. Neuwald, and C.E. Lawrence Bayesian models for multiple local sequence alignment and Gibbs sampling strategies J. Amer. Statist. Assoc. 90 1995 1156 1170
34. K.D. MacIsaac, and E. Fraenkel Practical strategies for discovering regulatory DNA sequence motifs PLoS Comput. Biol. 2 2006 e26
35. D.J.C. MacKay Information Theory, Inference, and Learning Algorithms 2003 Cambridge University Press New York
36. X.L. Meng, and D. Rubin Maximum likelihood estimation via the ECM algorithm: A general framework Biometrika 80 1993 267 278
37. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A. Teller, and H. Teller Equations of statecalculations by fast computing machines J. Chem. Phys. 21 1953 1087 1091
38. A.M. Michelson Deciphering genetic regulatory codes: A challenge for functional genomics Proc. Natl. Acad. Sci. USA 99 2002 546 548
39. R.M. Neal, and G.E. Hinton A view of the EM algorithm that justifies incremental, sparse, and other variants M. Jordan, Learning in Graphical Models 1998 NATO Science Series Kluwer 355 368
40. G. Pavesi, G. Mauri, and G. Pesole An algorithm for finding signals of unknown length in DNA sequenes Bioinformatics 17 suppl. 1 2001 S207 S214
41. Pevzner, P., Sze, S.H., 2000. Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. First ISMB Conference, vol. 1, pp. 269-278.
42. N. Rajewsky MicroRNA target predictions in animals Nat. Genet. 38 2006 S8 S13
43. B. Ren, F. Robert, J.J. Wyrick, O. Aparicio, E.G. Jennings, I. Simon, J. Zeitlinger, J. Schreiber, N. Hannett, E. Kannin, T.L. Volkert, C.J. Wilson, S.P. Bell, and R.A. Young Genome-wide location and function of DNA binding proteins Science 290 2000 2306 2309
44. A. Sandelin, W. Alkema, P. Engstrom, W.W. Wasserman, and B. Lenhard JASPAR: An open-access database for eukaryotic transcription factor binding profiles Nucl. Acids Res. 32 2004 D91 D94
45. G.D. Stormo DNA binding sites: Representation and discovery Bioinformatics 16 2000 16 23
46. G.D. Stormo, and G.W. Hartzell Identifying protein-binding sites from unaligned DNA fragments Proc. Natl. Acad. Sci. USA 86 1989 1183 1187
47. R.H. Swendsen, and J.S. Wang Nonuniversal critical dynamics in Monte Carlo simulations Phys. Rev. Lett. 58 1987 86 88
48. M.A. Tanner, and W.H. Wong The calculation of posterior distributions by data augmentation J. Amer. Statist. Assoc. 82 1987 528 550
49. M. Tompa, N. Li, T.L. Bailey, G.M. Church, B. De Moor, E. Eskin, A.V. Favorov, M.C. Frith, Y. Fu, W.J. Kent, V.J. Makeev, A.A. Mironov, W.S. Noble, G. Pavesi, G. Pesole, M. Regnier, N. Simonis, S. Sinha, G. Thijs, J. van Helden, M. Vandenbogaert, Z. Weng, C. Workman, C. Ye, and Z. Zhu Assessing computational tools for the discovery of transcription factor binding sites Nat. Biotechnol. 23 2005 137 144
50. C. Tuerk, and L. Gold Systematic evolution of ligands by exponential enrichment: RNA ligands to bacteriophage T4 DNA polymerase Science 249 1990 505 510
51. D.A. van Dyk, and X.-L. Meng The art of data augmentation J. Comput. Graphical Statist. 10 2001 1 50
52. L. Wang, and T. Jiang On the complexity of multiple sequence alignment J. Comput. Biol. 1 1994 337 348
53. G.C.G. Wei, and M.A. Tanner A Monte Carlo Implementation of the EM algorithm and the Poor Man's Data Augmentation Algorithms J. Amer. Statist. Assoc. 85 1990 699 704
54. C.F.J. Wu On the convergence properties of the EM algorithm Ann. Statist. 11 1983 95 103
55. Q. Zhou, and W.H. Wong CisModule: De novo discovery of cis-regulatory modules by hierarchical mixture modeling Proc. Natl. Acad. Sci. USA 101 2004 12114 12119
56. Q. Zhou, and W.H. Wong Coupling hidden Markov models for the discovery of cis-regulatory modules in multiple species Ann. Appl. Statist. 1 2007 36 37