An efficient algorithm for string motif discovery

Series on Advances in Bioinformatics and Computational Biology

Volumn 3, Issue , 2006, Pages 79-88

  Chin, Francis Y L ^a   Leung, Henry C M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BRUTE-FORCE APPROACH; CONTROL SEQUENCES; EFFICIENT ALGORITHM; GRAPH REPRESENTATION; INPUT SEQUENCE; MOTIF DISCOVERY; RUNNING TIME; SPACE COMPLEXITY;

ALGORITHMS; BIOINFORMATICS;

PROBLEM SOLVING;

EID: 84856996695     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. T. Bailey and C. Elkan. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning, 21:51-80, 1995
2. Y. Barash, G. Bejerano and N. Friedman. A simple hyper-geometric approach for discovering putative transcription factor binding sites. WABI, p278-293, 2001. (Pubitemid 33322589)
3. J. Buhler and M. Tompa. Finding motifs using random projections. RECOMB, p69-76, 2001. (Pubitemid 32866142)
4. F. Chin and H. Leung. Voting Algorithms for Discovering Long Motifs. APBC, p261-271, 2005.
5. F. Chin, H. Leung, S.M. Yiu, T.W. Lam, R. Rosenfeld, W.W. Tsang, D. Smith and Y. Jiang. Finding Motifs for Insufficient Number of Sequences with Strong Binding to Transcription Factor. RECOMB, p125-132, 2004
6. G. Z. Hertz and G. D. Stormo. Identification of consensus patterns in unaligned dna and protein sequences: a large-deviation statistical basis for penalizing gaps. In Proceedings of the 3rd International Conference on Bioinformatics and Genome Research, p201-216, 1995
7. U. Keich and P. Pevzner. Finding motifs in the twilight zone. RECOMB, p195-204, 2002
8. S. Kielbasa, J. Korbel, D. Beule, J. Schuchhardt and H. Herzel. Combining frequency and positional information to predict transcription factor binding sites. Bioinformatics, 17:1019-1026, 2001 (Pubitemid 33085608)
9. C. Lawrence, S. Altschul, M. Boguski, J. Liu, A. Neuwald and J. Wootton. Detecting subtule sequence signals: a Gibbs sampling strategy for multiple alignment. Science, 262:208-214, 1993
10. C. Lawrence and A. Reilly. An expectation maximization (em) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Structure, Function and Genetics, 7:41-51, 1990 (Pubitemid 20102601)
11. H. Leung and F. Chin. Finding Exact Optimal Motif in Matrix Representation by Partitioning. Bioinformatics, 21(supp 2):ii86-ii92, 2005 (Pubitemid 41535434)
12. H. Leung and F. Chin. Generalized Planted (l,d)-Motif Problem with Negative Set. WABI, p264-275, 2005
13. H. Leung, F. Chin, S.M. Yiu, R. Rosenfeld and W.W. Tsang. Finding Motifs with Insufficient Number of Strong Binding Sites. Jour. Comp. Biol., 2005 (will appear)
14. M. Li, B. Ma, and L. Wang. Finding similar regions in many strings. Journal of Computer and System Sciences, 65:73-96,2002
15. S. Liang. cWINNOWER Algorithm for Finding Fuzzy DNA Motifs. Computer Society Bioinformatics Conference, p260-265, 2003
16. G. Pesole, N. Prunella, S. Liuni, M. Attimonelli, and C. Saccone. Wordup: an efficient algorithm for discovering statistically significant patterns in dna sequences. Nucl. Acids Res., 20(11):2871-2875,1992.
17. P. Pevzner and S.H. Sze. Combinatorial approaches to finding subtle signals in dna sequences. In Proc. of the Eighth International Conference on Intelligent Systems for Molecular Biology, p269-278, 2000.
18. S. Rajasekaran, S. Balla and C.H. Huang. Exact algorithms for planted motif challenge problem. APBC, p249-259, 2005.
19. M.F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. In C.L. Lucchesi and A.V. Moura editors, Latin'98: Theoretical Informatics, volume 1380 of Lecture Notes in Computer Science, p111-127, 1998.
20. S. Sinha. Discriminative motifs. In Proc. of the Sixth Annual International Conference on Computational Biology, p291-298, 2002
21. S. Sinha and M. Tompa. A statistical method for finding transcription factor binding sites. In Proc. of the Eighth International Conference on Intelligent Systems for Molecular Biology, p344-354, 2000.
22. K.T. Takusagawa and D.K. Gifford. Negative information for motif discovery. PSB, p360-371, 2004
23. M. Tompa. An exact method for finding short motifs in sequences with application to the ribosome binding site problem. In Proc. of the 7th International Conference on Intelligent Systems for Molecular Biology, p262-271, 1999.
24. J. Zhu and M. Zhang. SCPD: a promoter database of the yeast Saccharomyces cerevisiae. Bioinformatics 15:563-577, 1999. http://cgsigma.cshl.org/jian/