-
1
-
-
4544295425
-
Environmentally induced foregut remodeling by pha-4/foxa and daf-12/nhr
-
Ao W., Gaudet J., Kent W.J., Muttumu S., and Mango S.E. Environmentally induced foregut remodeling by pha-4/foxa and daf-12/nhr. Science 305 5691 (2004) 1743-1746
-
(2004)
Science
, vol.305
, Issue.5691
, pp. 1743-1746
-
-
Ao, W.1
Gaudet, J.2
Kent, W.J.3
Muttumu, S.4
Mango, S.E.5
-
6
-
-
84857005866
-
-
M. Comin, L. Parida, Subtle motif discovery for the detection of dna regulatory sites, in: Proceedings of Asia Pacific Bioinformatics Conference, APBC'07, 2007, pp. 95-104
-
M. Comin, L. Parida, Subtle motif discovery for the detection of dna regulatory sites, in: Proceedings of Asia Pacific Bioinformatics Conference, APBC'07, 2007, pp. 95-104
-
-
-
-
7
-
-
0344376570
-
Finding composite regulatory patterns in DNA sequences
-
Eskin E., and Pevzner P. Finding composite regulatory patterns in DNA sequences. Bioinformatics 18 (2002) 354-363
-
(2002)
Bioinformatics
, vol.18
, pp. 354-363
-
-
Eskin, E.1
Pevzner, P.2
-
8
-
-
0032826179
-
Identifying DNA and protein patterns with statistically significant alignments of multiple sequences
-
Hertz G.Z., and Stormo G.D. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15 (1999) 563-577
-
(1999)
Bioinformatics
, vol.15
, pp. 563-577
-
-
Hertz, G.Z.1
Stormo, G.D.2
-
9
-
-
0036377219
-
-
Keich, Pevzner, Finding motifs in the twilight zone, in: Annual International Conference on Computational Molecular Biology, April 2002, pp. 195-204
-
Keich, Pevzner, Finding motifs in the twilight zone, in: Annual International Conference on Computational Molecular Biology, April 2002, pp. 195-204
-
-
-
-
10
-
-
0036772507
-
Subtle motifs: Defining the limits of motif finding algorithms
-
Keich U., and Pevzner P. Subtle motifs: Defining the limits of motif finding algorithms. Bioinformatics 18 (2002) 1382-1390
-
(2002)
Bioinformatics
, vol.18
, pp. 1382-1390
-
-
Keich, U.1
Pevzner, P.2
-
11
-
-
0025320805
-
An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences
-
Lawrence C.E., and Reilly A.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
-
(1990)
Proteins: Structure, Function and Genetics
, vol.7
, pp. 41-51
-
-
Lawrence, C.E.1
Reilly, A.A.2
-
12
-
-
0027912333
-
Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment
-
Lawrence C.E., Altschul S.F., Boguski M.S., Liu J.S., Neuwald A.F., and Wootton J.C. Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science 262 (1993) 208-214
-
(1993)
Science
, vol.262
, pp. 208-214
-
-
Lawrence, C.E.1
Altschul, S.F.2
Boguski, M.S.3
Liu, J.S.4
Neuwald, A.F.5
Wootton, J.C.6
-
14
-
-
19944377164
-
Bases of motifs for generating repeated patterns with wild cards
-
Pisanti N., Crochemore M., Grossi R., and Sagot M.-F. Bases of motifs for generating repeated patterns with wild cards. IEEE/ACM Transaction on Computational Biology and Bioinformatics 2 1 (2005) 40-50
-
(2005)
IEEE/ACM Transaction on Computational Biology and Bioinformatics
, vol.2
, Issue.1
, pp. 40-50
-
-
Pisanti, N.1
Crochemore, M.2
Grossi, R.3
Sagot, M.-F.4
-
15
-
-
2342476143
-
Finding subtle motifs by branching from sample strings
-
Price A., Ramabhadran S., and Pevzner P. Finding subtle motifs by branching from sample strings. Bioinformatics 1 (2003) 149-155
-
(2003)
Bioinformatics
, Issue.1
, pp. 149-155
-
-
Price, A.1
Ramabhadran, S.2
Pevzner, P.3
-
17
-
-
80053455778
-
Spelling approximate repeated or common motifs using a suffix tree
-
Latin 98: Theoretical Informatics
-
Sagot M.F. Spelling approximate repeated or common motifs using a suffix tree. Latin 98: Theoretical Informatics. Lecture Notes in Computer Science vol. 1380 (1998) 111-127
-
(1998)
Lecture Notes in Computer Science
, vol.1380
, pp. 111-127
-
-
Sagot, M.F.1
-
18
-
-
21144439147
-
Assessing computational tools for the discovery of transcription factor binding sites
-
Tompa M., Li N., Bailey T.L., Church G.M., Moor B.D., Eskin E., Favorov A.V., Frith M.C., Fu Y., Kent W.J., Makeev V.J., Mironov A.A., Noble1 W.S., Pavesi G., Pesole G., Rgnier M., Simonis N., Sinha S., Thijs G., van Helden J., Vandenbogaert M., Weng Z., Workman C., Ye C., and Zhu Z. Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology 23 (2005) 137-144
-
(2005)
Nature Biotechnology
, vol.23
, pp. 137-144
-
-
Tompa, M.1
Li, N.2
Bailey, T.L.3
Church, G.M.4
Moor, B.D.5
Eskin, E.6
Favorov, A.V.7
Frith, M.C.8
Fu, Y.9
Kent, W.J.10
Makeev, V.J.11
Mironov, A.A.12
Noble1, W.S.13
Pavesi, G.14
Pesole, G.15
Rgnier, M.16
Simonis, N.17
Sinha, S.18
Thijs, G.19
van Helden, J.20
Vandenbogaert, M.21
Weng, Z.22
Workman, C.23
Ye, C.24
Zhu, Z.25
more..
-
19
-
-
0021665479
-
Pattern recognition in several sequences: Consensus and alignment
-
Waterman M.S., Aratia R., and Galas D.J. Pattern recognition in several sequences: Consensus and alignment. Bulletin of Mathematical Biology 46 4 (1984) 515-527
-
(1984)
Bulletin of Mathematical Biology
, vol.46
, Issue.4
, pp. 515-527
-
-
Waterman, M.S.1
Aratia, R.2
Galas, D.J.3
|