Deterministic local alignment methods improved by a simple genetic algorithm

Neurocomputing

Volumn 73, Issue 13-15, 2010, Pages 2394-2406

  Bi, Chengpeng ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Expectation maximization (EM); Genetic algorithms (GA); Memetic algorithms; Motif discovery; Multiple sequence local alignment

Indexed keywords

EXPECTATION MAXIMIZATION; EXPECTATION MAXIMIZATION (EM); LOCAL ALIGNMENT; MEMETIC ALGORITHMS; MOTIF DISCOVERY; MULTIPLE SEQUENCES;

ALIGNMENT; BIOINFORMATICS; COMPUTATION THEORY; DNA SEQUENCES; FUNCTION EVALUATION; MAXIMUM LIKELIHOOD; MAXIMUM PRINCIPLE; OPTIMIZATION;

GENETIC ALGORITHMS;

ACCURACY; AMINO ACID SEQUENCE; ARTICLE; CALCULATION; CONTROLLED STUDY; DNA SEQUENCE; GENETIC ALGORITHM; GENETIC ENABLED EM MOTIF FINDING ALGORITHM; INTERMETHOD COMPARISON; PRIORITY JOURNAL; QUALITY CONTROL; REGULATORY SEQUENCE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SIMULATION;

EID: 77955331971     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2010.01.023     Document Type: Article

References (51)

1. Bailey T.L., Elkan C. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 1995, 21:51-80.
2. T.L. Bailey, C. Elkan, Fitting a mixture model by expectation maximization to discover motifs in biopolymers, in: Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Park, California, 1994, pp. 28-36.
3. Berg O.G. Selection of DNA binding sites by regulatory proteins: the LexA protein and the argine repressor use different strategies for functional specificity. Nucleic Acids Research 1988, 16:5089-5105.
4. Berg O.G., von Hippel P.H. Selection of DNA binding sites by regulatory proteins: statistical-mechanical theory and application to operators and promoters. Journal of Molecular Biology 1987, 193:723-750.
5. C. Bi, A genetic-based EM motif-finding algorithm for biological sequence analysis, in: Proceedings of IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2007, pp. 275-282.
6. Bi C. A Monte Carlo EM algorithm for de novo motif discovery in biomolecular sequences. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2009, 6:370-386.
7. Bi C. Pattern Classification of the Rhagoletis pomonella Species Complex 2002, Pennsylvania State University Graduate School, University Park, PA.
8. Bi C. SEAM: a stochastic EM-type algorithm for motif-finding in biopolymer sequences. Journal of Bioinformatics and Computational Biology 2007, 5:47-77.
9. Bi C. DNA motif alignment through evolving a population of Markov chains. BMC Bioinformatics 2009, 10:S13.
10. Bi C. Data augmentation algorithms for detecting conserved domains in protein sequences: a comparative study. Journal of Proteome Research 2008, 7:192-210.
11. Bi C., Leeder J.S., Vyhlidal C.A. A comparative study on computational two-block motif detection: algorithms and applications. Molecular Pharmaceutics 2008, 5:3-16.
12. C. Bi, Comparison of optimization techniques for sequence pattern discovery by maximum-likelihood, Pattern Recognition Letters (2010), doi:10.1016/j.patrec.2009.09.005.
13. Buhler J., Tompa M. Finding motifs using random projection. Journal of Computational Biology 2002, 9:225-242.
14. Celeux G., Diebolt J. Stochastic versions of the EM algorithm: an experimental study in the mixture case. Journal of Statistical Computation and Simulation 1996, 55:287-314.
15. D. Che, Y. Song, K. Rasheed, MDGA: motif discovery using a genetic algorithm, in: Proceedings of GECCO, 2005, pp. 447-452.
16. De Crombrugghe B., Busby S., Buc H. Cyclic AMP receptor protein: role in transcription activation. Science 1984, 224:831-838.
17. Dempster A.P., Laird A.M., Rubin D.B. Maximum likelihood from Incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistics Society B 1977, 39:1-38.
18. Edgar R.C. MUSCLE: multiple sequence alignment with high accuracy and high thoughput. Nucleic Acids Research 2004, 32:1792-1797.
19. The ENCODE Project Consortium, Identification and analysis of functional elements in 1% of the human genome by the ENCODE pilot project, Science 447 (2007) 799-816.
20. Gasch A.P., Eisen M.B. Exploring the conditional coagulation of yeast gene expression through fuzzy k-means clustering. BMC Bioinformatics 2002, 3:1.
21. D.E. Goldberg, K. Deb, B. Korb, Do not worry, be messy, in: Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, California, 1991, pp. 24-30.
22. Ji H., Wong W.H. Computational biology: towards deciphering gene regulatory information in mammalian genomes. Biometrics 2006, 62:645-663.
23. Kel A.E., Kel-Margoulis O.V., Farnham P.J., Bartley S.M., Wingender E., Zhang M.Q. Computer-assisted identification of cell cycle-related genes: new targets for E2F transcription factors. Journal of Molecular Biology 2001, 309:99-120.
24. Klinge C.M. Estrogen receptor interaction with estrogen response elements. Nucleic Acids Research 2001, 29:2905-2919.
25. Krasnogor N., Smith J. A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Transactions on Evolutionary Computation 2005, 9:474-488.
26. Lawrence C.E., Reilly A.A. An expectation maximization algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Structure, Function and Genetics 1990, 7:41-51.
27. Liu J.S. Monte Carlo Strategies for Scientific Computing 2001, Springer-Verlag.
28. 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.
29. Liu X., Brutlag D.L., Liu J.S. BioProspector: discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes. Pacific Symposium on Biocomputing 2001, 127-138.
30. F.F.M. Liu, J.J.P. Tsai, R.M. Chen, S.N. Chen, S.H. Shih, FMGA: finding motifs by genetic algorithm, in: Proceedings of BIBE, 2004, p. 459.
31. MacIsaac K.D., Fraenkel E. Practical strategies for discovering regulatory DNA sequence motifs. PLoS Computational Biology 2006, 2:e36.
32. Martinez A.M., Vitria J. Learning mixture models using a genetic version of the EM algorithm. Pattern Recognition Letters 2000, 21:759-769.
33. Mitchell M. An Introduction to Genetic Algorithms 1998, MIT Press, Cambridge, MA.
34. Notredame C., Higgins D.G. SAGA: sequence alignment by genetic algorithm. Nucleic Acids Research 1996, 24:1515-1524.
35. Pavesi G., Mauri G., Pesole G.G. An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics 2001, 17:S207-S214.
36. Pernkopf F., Bouchaffra D. Genetic-based EM algorithm for learning Gaussian mixture models. IEEE Transaction on Pattern Analysis and Machine Intelligence 2005, 27:1344-1348.
37. P.A. Pevzner, S-H. Sze, Combinatorial approaches to finding subtle signals in DNA sequences, in: Proceedings of ISCB, 2000, pp. 269-278.
38. Salgado H., Gama-Castro S., Peralta-Gil M., Diaz-Peredo E., Sanchez-Solano F., Santos-Zavaleta A., Martinez-Flores I., Jimenez-Jacinto V., Bonavides-Martinez C., Segura-Salazar J., Martinez-Antonio A., Collado-Vides J. RegulonDB (version 5.0): Escherichia coli K-12 transcriptional regulatory network, operon organization, and growth conditions. Nucleic Acids Research 2006, 34:D394-D397.
39. Sandelin A., Alkema W., Engstrom P., Wasserman W.W., Lenhard B. JASPAR: an open-access database for eukaryotic transcription factor binding profiles. Nucleic Acids Research 2004, 32:D91-D94.
40. M. Stine, D. Dasgupta, S. Mukatira, Motif discovery in upstream sequences of coordinately expressed genes, in: Proceedings of CEC, 2003, pp. 1596-1603.
41. Stormo G.D., Hartzell G.W. Identifying protein-binding sites from unaligned DNA fragments. Proceedings of the National Academy of Sciences of the United States of America 1989, 86:1183-1187.
42. Thijs G., Marchal K., Lescot M., Rombauts S., De Moor B., Roze P., Moreau Y. A Gibbs sampling method to detect over-represented motifs in the upstream regions of co-expressed genes. Journal of Computational Biology 2002, 9:447-464.
43. Thompson J.D., Higgins D.G., Gibson T.J. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 1994, 22:4673-4680.
44. Thompson J.D., Koehl P., Ripp R., Poch O. BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 2005, 61:127-136.
45. Wang L., Jiang T. On the complexity of multiple sequence alignment. Journal of Computational Biology 1994, 1:337-348.
46. Waterman M.S., Arratia R., Galas D.J. Pattern recognition in several sequences: consensus and alignment. Bulletin of Mathematical Biology 1984, 46:515-527.
47. Waterman W.S. Introduction to Computational Biology: Maps, Sequences and Genomes 1995, Chapman & Hall/CRC Press, Florida.
48. Wei G.C.G., Tanner M.A. A Monte Carlo implementation of the EM algorithm and the poor man's data augmentation algorithms. Journal of the American Statistical Association 1990, 85:699-704.
49. Wei Z., Jensen S.T. GAME: detecting cis-regulatory elements using genetic algorithm. Bioinformatics 2006, 22:1577-1584.
50. Wu C.F.J. On the convergence properties of the EM algorithm. The Annals of Statistics 1983, 11:95-103.
51. Zhou Q., Wong W.H. CisModule: de novo discovery of cis-regulatory modules by hierarchical mixture modeling. Proceedings of the National Academy of Sciences of the United States of America 2004, 101:12114-12119.