Tackling the challenging motif problem through hybrid particle swarm optimized alignment clustering

IEEE SSCI 2011 - Symposium Series on Computational Intelligence - CIBCB 2011: 2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology

Volumn , Issue , 2011, Pages 84-91

  Bi, Chengpeng ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; GIBBS SAMPLING; HIGH PRECISION; HIGH QUALITY; HYBRID ALGORITHMS; HYBRID PARTICLES; POTENTIAL SOLUTIONS;

ALIGNMENT; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; LAKES; PARTICLE SWARM OPTIMIZATION (PSO); REFINING;

CLUSTERING ALGORITHMS;

EID: 80053129958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIBCB.2011.5948452     Document Type: Conference Paper

References (33)

1. P.J. Park, ChIP-seq: advantages and challenges of a maturing technology. Nature Reviews Genetics 2009, 10:669-680.
2. H. Ji and W.W. Wong, Computational biology: Towards deciphering gene regulatory information in mammalian genomes. Biometrics 2006, 62:645-663.
3. C. Bi, Comparison of optimization techniques for sequence pattern discovery by maximum likelihood. Pattern Recognition Letters 2010, 31: 2147-2160.
4. G.D. Stormo, DNA binding sites: representation and discovery. Bioinformatics 2000, 16:16-23. (Pubitemid 30204197)
5. C.E. Lawrence and A.A. Reilly, 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. (Pubitemid 20102601)
6. T.L. Bailey and 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, 1994, pp. 28-36. Menlo Park, California: AAAI Press.
7. C. Bi, SEAM: A stochastic EM-type algorithm for motif-finding in biopolymer sequences. Journal of Bioinformatics and Computational Biology 2007, 5:47-77. (Pubitemid 46705936)
8. C.E. Lawrence et al., Detecting Subtle Sequence Signals: A Gibbs Sampling Strategy for Multiple Alignment. Science 1993, 262:208-214.
9. C. Bi, Data augmentation algorithms for detecting conserved domains in protein sequences: A comparative study. Journal of Proteome Research 2008, 7:192-210.
10. M. Sagot, Spelling approximate repeated or common motifs using a suffix tree. In Theoretical informatics, 1380. Edited by Lucchesi C, Moura A 1998:111-127.
11. P. Pevzner and S.H. Sze, Combinatorial approaches to finding subtle signals in DNA sequences. In Proc. First ISMB Conference 2000, 1:269-278.
12. J. Buhler and M. Tompa, Finding motifs using random projection. Journal of Computational Biology 2002, 9:225-242. (Pubitemid 34548262)
13. H.C.M. Leung and F.Y.L Chin, Algorithms for challenging motif problems. J. Bioinform. Computat. Biol. 2006, 4:43-58.
14. M.P. Styczynski, K.L. Jensen, I. Rigoutsos and G.N. Stephanopoulos, An extension and novel solution to the (l,d)-motif challenge problem. Genome Informatics 2004, 15:63-71.
15. H.C.M. Leung and FY Chin, Generalized planted (l,d)-motif problem with negative set. In WABI05 LNBI 3692. Edited by R C, G M, Springer-Verlag Berlin Heidelberg 2005:264-275.
16. C. Bi, 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.
17. C. Bi, DNA motif alignment through evolving a population of Markov chains, BMC Bioinformatics 2009, 10: S13.
18. 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 200, pages 275-282.
19. C. Bi, Deterministic local alignment methods improved by a simple genetic algorithm, Neurocomputing 2010 73:2394-2406.
20. C. Bi, Evolutionary Metropolis sampling in sequence alignment space. Proc. 2008 IEEE Congress on Evolutionary Computation (CEC) 2008, pp. 189-194.
21. J. Kennedy and R.C. Eberhart, Particle swarm optimization. In Proc. IEEE Int. Conf. Neural Networks, Perth, Australia, Nov. 1995, pp. 1942-1948.
22. M.A.M. De Oca, T. Stutzle, M. Birattari and M. Dorigo, Frankenstein's PSO: A composite particle swarm optimization algorithm. IEEE Transactions on Evolutionary Computation 2009, 13:1120-1132.
23. R. Poli, J. Kennedy and T. Blackwell, Particle swarm optimization: An overview. Swarm Intelligence 2007,1:33-57.
24. O. Berg and P. Von Hippel, 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.
25. L. Wang and T. Jiang, On the complexity of multiple sequence alignment. Journal of Computational Biology 1994, 1:337-348.
26. E. R. Mardis, Next-generation DNA sequencing methods. Annu. Rev. Genomics Hum. Genet. 2008, 9:387-402.
27. A. Barski, S. Cuddapah, K. Cui, T.Y. Roh, D.E. Schones, Z. Wang, G. Wei, I. Chepelev, and K. Zhao, High-resolution profiling of histone methylations in the human genome. Cell 2007, 129:823-837. (Pubitemid 46802390)
28. 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. (Pubitemid 46906620)
29. G. Robertson, M. Hirst, M. Bainbridge, M. Bilenky, Y. Zhao and T. Zeng, Genome-wide profiles of STAT1 DNA association using chromatin immunoprecipitation and massively parallel sequencing. Nature Methods 4 (2007) 651-657. (Pubitemid 47202477)
30. R. Jothi, S. Cuddapah, A. Barski, K. Cui and K. Zhao, Genome-wide identification of in vivo protein-DNA binding sites from ChIP-Seq data. Nucleic Acids Research 2008, 36:5221-5231.
31. T.H. Kim, Z.K. Abdullaev, A.D. Smith, K.A. Ching, D.I. Loukinov, R.D. Green, M.Q. Zhang, V.V. Lobanenkov and B. Ren, Analysis of the vertebrate insulator protein CTCF-binding sites in the human genome. Cell 2007, 128:1231-1245. (Pubitemid 46427876)
32. C. Bi, J.S. Leeder and C.A. Vyhlidal, A comparative study on computational two-block motif detection: algorithms and applications. Molecular Pharmaceutics 2008, 5:3-16. (Pubitemid 351300030)
33. O. Bembom, S. Keles, and M.J. Van der Laan, Supervised detection of conserved motifs in DNA sequences with cosmo. Statistical Applications in Genetics and Molecular Biology 2006, 6:Article 8