Identification of weak motifs in multiple biological sequences using genetic algorithm

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 271-278

  Paul, Topon Kumar ^a   Iba, Hitoshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

(l, d) motif; Clustering; DNA sequences; Genetic algorithm; Motif discovery; Protein binding site; Regulatory sites

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONFORMATIONS; GENETIC ALGORITHMS; MUTAGENESIS; PROTEINS;

MOTIF DISCOVERY; MOTIF RECOGNITION; PROTEIN BINDING SITES; REGULATORY SITES;

DNA SEQUENCES;

EID: 33750275579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144044     Document Type: Conference Paper

References (26)

1. T. L. Bailey and C. Elkan. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning, 21:51-80, 1995.
2. J. Buhler and M. Tompa. Finding motifs using random projections. J. Comput. Biol., 9(2):225-242, 2002.
3. D. Che, Y. Song, and K. Rasheed. MDGA: Motif discovery using a genetic algorithm. In Proceedings of GECCO2005, pages 447-452, 2005.
4. F. Y. L. Chin and H. C. M. Leung. Voting algorithms for discovering long motifs. In APBC, pages 261-271, 2005.
5. G. B. Fogel, D. G. Weekes, G. Varga, E. R. Dow, H. B. Harlow, J. E. Onyia, and C. Su. Discovery of sequence motifs related to coexpression of genes using evolutionary computation. Nucleic Acids Research, 32(13):3826-3835, 2004.
6. J. Gertz, L. Riles, P. Turnbaugh, S.-W. Ho, and B. A. Cohen. Discovery, validation, and genetic dissection of transcription factor binding sites by comparative and functional genomics. Genome Research, 15:1145-1152, 2005.
7. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
8. D. L. Hartl and E. W. Jones. Genetics, Analysis of Genes and Genomes, page 407. Jones and Bartlett Publishers, sixth edition, 2005.
9. G. Z. Hertz and G. D. Stormo. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15:563-577, 1999.
10. J. H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, 1975.
11. J. Hu, B. Li, and D. Kihara. Limitations and potentials of current motif discovery algorithms. Nucleic Acids Research, 33(15):4899-4913, 2005.
12. I. Jonassen, J. F. Collins, and D. Higgins. Finding fexible patterns in unaligned protein sequences. Protein Science, 4(8): 1587-1595, 1995.
13. J. R. Koza and D. Andre. Automatic discovery of protein motifs using genetic programming. In X. Yao, editor, Evolutionary Computation, pages 171-197. World Scientific, 1999.
14. C. E. Lawrence, S. F. Altschul, M. S. Boguski, J. S. Liu, A. F. Neuwald, and J. C. Wootton. Detecting subtle sequence signals: a gibbs sampling strategy for multiple alignment. Science, 262:208-214, 1993.
15. X. Liu, D. L. Burtlag, and J. S. Liu. Bioprospector: discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes. Pacific Symposium on Biocomputing, 6:127-138, 2001.
16. X. S. Liu, D. L. Brutlag, and J. S. Liu. An algorithm for finding protein-DNA binding sites with applications to chromatin immunoprecipitation microarray experiments. Nat. Biotechnol., 20:835-839, 2002.
17. A. F. Neuwald, J. S. Liu, and C. E. Lawrence. Gibbs motif sampling: detection of bacterial outer membrane protein repeats. Protein Science, 4:1618-1632, 1995.
18. P. A. Pevzner and S.-H. Sze. Combinatorial approaches to finding subtle signal in dna sequences. In Intelligent System for Molecular Biology, pages 269-278, 2000.
19. I. Rigoutsos and A. Floratos. Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics, 14:55-67, 1998.
20. F. P. Roth, J. D. Hughes, P. W. Estep, and G. M. Church. Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation. Nature Biotechnology, 16:939-945, 1998.
21. SCPD: The Promoter Database of Saccharomyces Cerevisiae. URL: http://rulai.cshl.edu/SCPD/.
22. Sequence motif-Wikipedia. URL: http://en.wikipedia.org/wiki/Sequence. motif.
23. G. D. Stormo and G. W. Hartzell. Identifying protein-binding sites from unaligned DNA fragments. Proceedings of National Academy of Science, 86:1183-1187, 1989.
24. 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, 15(2):63-71, 2004.
25. G. Thijs, K. Marchai, M. Lescot, S. Rombauts, B. De Moore, P. Rouze, and Y. Moreau. A Gibbs sampling method to detect overrepresented motifs in the upstream regions of coexpressed genes. J. Comput. Biol., 9:447-464, 2002.
26. X. Yang and J. C. Rajapakse. Graphical approach to weak motif recognition. Genome Informatics, 15(2):52-62, 2004.