Data augmentation algorithms for detecting conserved domains in protein sequences: A comparative study

Journal of Proteome Research

Volumn 7, Issue 1, 2008, Pages 192-201

  Bi, Chengpeng ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Data augmentation; Expectation maximization (EM); Gibbs sampling; Markov chain Monte Carlo; Motif discovery; Multiple local alignment; Protein sequence analysis

Indexed keywords

HELIX LOOP HELIX PROTEIN;

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; COMPARATIVE STUDY; MAXIMUM LIKELIHOOD METHOD; MONTE CARLO METHOD; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN DOMAIN; PROTEIN MOTIF; STATISTICAL ANALYSIS;

ALGORITHMS; AMINO ACID MOTIFS; CONSERVED SEQUENCE; INFORMATION STORAGE AND RETRIEVAL; LIKELIHOOD FUNCTIONS; MONTE CARLO METHOD; PROTEIN STRUCTURE, TERTIARY; SEQUENCE ALIGNMENT; STOCHASTIC PROCESSES; STRUCTURAL HOMOLOGY, PROTEIN;

EID: 38649088564     PISSN: 15353893     EISSN: None     Source Type: Journal    
DOI: 10.1021/pr070475q     Document Type: Article

References (39)

1. Lawrence, C. E.; Altschul, S. F.; Boguski, M. S.; Liu, J. S.; Neuwald, A. F.; Wootton, J. C. Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science 1993, 262, 208-214.
2. Neuwald, A. F.; Liu, J. S.; Lawrence, C. E. Gibbs motif sampling: Detection of bacterial outer membrane protein repeats. Protein Sci. 1995, 4, 1618-1632.
3. Livingstone, C. D.; Barton, G. J. Protein sequence alignments: a strategy for the hierarchical analysis of residue conservation. Comput. Appl. Biosci. 1993, 9, 745-756.
4. Rost, B.; Sander, C. Combining evolutionary information and neural networks to predict protein secondary structure. Proteins 1994, 19, 55-72.
5. Baker, D.; Sali, A. Protein structure prediction and structural genomics. Science 2001, 294, 93-96.
6. Thompson, J. D.; Plewniak, F.; Poch, O. A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res. 1999, 27, 2682-2690.
7. Dempster, A. P.; Laird, N. M.; Rubin, D. B. Maximum Likelihood from Incomplete Data via the EM Algorithm (with Discussion). J. Royal Stat. Soc. B 1977, 39, 1-38.
8. Lawrence, C. E.; Reilly, A. A. An expectation maximization algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Struct., Funct., Genet. 1990, 7, 41-51.
9. Bailey, T. L.; Elkan, C. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 1995, 21, 51-80.
10. Geman, S.; Geman, D. Stochastic relaxation, Gibbs distribution and Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 1984, 6, 721-741.
11. Liu, J. S.; Neuwald, A. F.; Lawrence, C. E. Bayesian models for multiple local sequence alignment and Gibbs sampling strategies. J. Am. Stat. Assoc. 1995, 90, 1156-1170.
12. Durbin, R.; Eddy, S.; Krogh, A.; Mitchison, G. Biological sequence analysis: probabilistic models of proteins and nucleic acids; Cambridge University Press UK: London, 1998.
13. MacIsaac, K. D.; Fraenkel, E. Practical strategies for discovering regulatory DNA sequence motifs. PLoS Comput. Biol. 2006, 2, e26.
14. Ji, H.; Wong, W. W. Computational biology: Towards deciphering gene regulatory information in mammalian genomes. Biometrics 2006, 62, 645-663.
15. Edgar, R. C.; Batzoglou, S. Multiple sequence alignment. Curr. Opin. Struct. Biol. 2006, 16, 368-373.
16. Liu, J. S. Bayesian modeling and computation in bioinformatics research. In Current Topics in Computational Biology, Jiang, T., Xu, Y., Zhang, M., Ed.; MIT Press.: Cambridge, MA, 2002; pp 11-44.
17. van Dyk, D. A.; Meng, X.-L. The art of data augmentation. J. Comput. Graphical Stat. 2001, 10, 1-50.
18. Metropolis, N.; Rosenbluth, A. W.; Rosenbluth, M. N.; Teller, A.; Teller, H. Equations of statecalculations by fast computing machines. J. Chem. Phys. 1953, 12, 1087-1091.
19. Bi, C.-P. SEAM: A stochastic EM-type algorithm for motif-finding in biopolymer sequences. J. Bioinf. Comput. Biol. 2007, 5, 47-77.
20. Tanner, M. A.; Wong, W. H. The calculation of posterior distributions by data augmentation. J. Am. Stat. Assoc. 1987, 82, 528-550.
21. Swendsen, R. H.; Wang, J. S. Nonuniversal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett. 1987, 58, 86-88.
22. Meng, X. L.; Rubin, D. Maximum likelihood estimation via the ECM algorithm: A general framework. Biometrika 1993, 80, 267-278.
23. Wei, G. C. G.; Tanner, M. A. A Monte Carlo implementation of the EM algorithm and the poor man's data augmentation algorithms. J. Am. Stat. Assoc. 1990, 85, 699-704.
24. Bi, C.-P. Multiple sequence local alignment using Monte Carlo EM algorithm. In ISBRA 2007 Lecture Notes in Bioinformatics; Mandoiu, I., Zelikovsky, A., Eds.; Springer-Verlag: Berlin Heidelberg, 2007; Vol. 4463, 465-476.
25. Liu, J. S. Monte Carlo Strategies in Scientific Computing, Springer: New York, 2001.
26. Neal, R. M.; Hinton, G. E. A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in Graphical Models; Jordan, M., Ed.; NATO Science Series Huwer: Norwell, MA, 1998; pp 355-368.
27. Fraley, C.; Raftery, A. Model-based clustering, discriminant analysis, and density estimation. J. Am. Stat. Assoc. 2002, 97, 611-631.
28. Stormo, G. D. DNA binding sites: representation and discovery. Bioinformatics 2000, 16, 16-23.
29. Berg, O. G.; von Hippel, P. H. Selection of DNA binding sites by regulatory proteins: Statistical-mechanical theory and application to operators and promoters. J. Mol. Biol. 1987, 193, 723-750.
30. Wang, L.; Jiang, T. On the complexity of multiple sequence alignment. J. Comput. Biol. 1994, 1, 337-348.
31. Tompa, M.; Li, N.; Bailey, T. L.; Church, G. M.; De Moor, B.; Eskin, E.; Favorov, A. V.; Frith, M. C.; Fu, Y.; Kent, W. J.; Makeev, V. J.; Mironor, A. A.; Noble, W. S.; Pavesi, G.; Pesole, G.; Regnier, M.; Simonis, N.; Sinha, S.; Thijs, G.; vanHelden, J.; Vandenbogaert, M.; Weng, Z.; Workman, C.; Ye, C.; Zhu, Z. Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol. 2005, 23, 137-144.
32. Bi, C.-P. A genetic-based EM motif-finding algorithm for biological sequence analysis. Proc. of IEEE Symp. on Computat. Intell. Bioinf. Computat. Biol. 2007, 07, 275-282.
33. Bembom, O.; Keles, S.; van der Laan, M. J. Supervised detection of conserved motifs in DNA sequences with cosmo. Stat. Appl. Genet. Mol. Biol. 2006, 6,Article 8.
34. Krell, T.; Molina-Henares, A. J.; Ramos, J. L. The IcIR family of transcriptional activators and repressors can be defined by a single profile. Protein Sci. 2006, 15, 1207-1213.
35. Marchler-Bauer, A.; Anderson, J. B.; Derbyshire, M. K.; DeWeese-Scott, C.; Gonzales, N. R.; Gwadz, M.; Hao, L.; He, S.; Hurwitz, D. I.; Jackson, J. D.; Ke, Z.; Krylov, D. et al. CDD: a conserved domain database for interactive domain family analysis. Nucleic Acids Res. 2007, 35, D237-40.
36. Thompson, J. D.; Koehl, P.; Ripp, R.; Poch, O. BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark. Proteins 2005, 61, 127-36.
37. Pevzner, P. A.; Sze, S.-H. Combinatorial approaches to finding subtle signals in DNA sequences. Proc. Int. Conf. Intell. Syst. Mol. Biol. 2000, 8, 269-278.
38. Edgar, R. C. MUSCLE: multiple sequence alignment with high accuracy and high thoughput. Nucleic Acids Res. 2004, 32, 1792-1797.
39. Thompson, W. A.; Newberg, L. A.; Conlan, S.; McCue, L. A.; Lawrence, C. E. The Gibbs centroid sampler. Nucleic Acids Res. 2007, 35, W232-W237.