Generalized planted (l,d)-motif problem with negative set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3692 LNBI, Issue , 2005, Pages 264-275

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

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INFORMATION ANALYSIS; MOLECULAR BIOLOGY; PROBLEM SOLVING; SET THEORY;

COMPUTATIONAL MOLECULAR BIOLOGY; MOTIF; PEVZNER AND SZE; VANS;

PATTERN RECOGNITION;

EID: 33646175558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557067_22     Document Type: Conference Paper

References (21)

1. Bailey, T., Charles Elkan, C.: Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning. 21 (1995) 51-80
2. Barash, Y., Bejerano, G., Friedman, N.: A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites. Workshop on Algorithms in Bioinformatics WABI 1 (2001) 278-293
3. Brazma, A., Jonassen, I., Eidhammer, I., Gilbert, D.: Approaches to the automatic discovery of patterns in biosequences. Jour. Comp. Biol. 5 (1998) 279-305
4. Buhler, J., Tompa, M.: Finding motifs using random projections. Research in Computational Molecular Biology RECOMB 1 (2001) 69-76
5. Chin, F., Leung, H.: Voting Algorithms for Discovering Long Motifs. Asia-Pacific Bioinformatics Conference APBC 3 (2005) 261-271
6. Chin, F., Leung, H., Yiu, S.M., Lam, T.W., Rosenfeld, R., Tsang, W.W., Smith, D., Jiang, Y.: Finding Motifs for Insufficient Number of Sequences with Strong Binding to Transcription Factor. Research in Computational Molecular Biology RECOMB 4 (2004) 125-132
7. Chin, F., Leung, H., Yiu, S.M., Rosenfeld, R., Tsang, W.W.: Finding Motifs with Insufficient Number of Strong Binding Sites. Jour. Comp. Biol. (to appear)
8. Fraenkel, Y., Mandel, Y., Friedberg, D., Margalit. H.: Identification of common motifs in unaligned dna sequences: application to Escherichia coli Lrp regulon. Bioinformatics 11 (1995) 379-387
9. Gelfand, M., Koonin, E., Mironov, A.: Prediction of transcription regulatory sites in archaea by a comparative genomic approach. Nucl. Acids Res. 28 (2000) 695-705
10. J. van Helden, B. Andre, Vides, J.C.: Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. Journal of Molecular Biology 281(5) (1998) 827-842
11. Hertz, G.Z., Stormo, G.D.: Identification of consensus patterns in unaligned dna and protein sequences: a large-deviation statistical basis for penalizing gaps. International Conference on Bioinformatics and Genome Research 3 (1995) 201-216
12. Lawrence, C., Altschul, S., Boguski, M., Liu, J., Neuwald, A., Wootton, J.: Detecting subtule sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262 (1993) 208-214
13. Lawrence, C., Reilly, A.: An expectation maximization (em) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Structure, Function and Genetics 7 (1990) 41-51
14. Leung, H., Chin, F.: Finding Exact Optimal Motif in Matrix Representation by Partitioning. European Conference on Computational Biology ECCB (2005) (to appear)
15. Liang, S.: cWINNOWER. Algorithm for Finding Fuzzy DNA Motifs. Computer Society Bioinformatics Conference 2 (2003) 260-265
16. Marsan L., Sagot, M.F.: Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. Jour. Comp. Biol. 7(3-4) (2000) 345-362
17. Pesole, C., Prunella, N., Luni, S., Attimonelli, M., Saccone, C.: Wordup: an efficient algorithm for discovering statistically significant patterns in dna sequences. Nucl. Acids. Res. 20(11) (1992) 2871-2875
18. Pevzner, P, Sze, S.H.: Combinatorial approaches to finding subtle signals in dna sequences. International Conference on Intelligent Systems for Molecular Biology 8 (2000) 269-278
19. Sagot, M.E.: Spelling approximate repeated or common motifs using a suffix tree. Latin'98: Theoretical informatics, Lecture Notes in Computer Science 1380 (1998) 111-127
20. Sinha, S.: Discriminative motifs. Jour. Comp. Biol. 10 (2003) 599-610
21. Zhu, J., Zhang, M.: SCPD: a promoter database of the yeast Saccha-romyces cerevisiae. http://cgsigma.cshl.org/jian/ Bioinformatics 15 (1999) 563-577