Analysis of computational approaches for motif discovery
暂无分享,去创建一个
Nan Li | Martin Tompa | M. Tompa | Nan Li
[1] P. McCullagh,et al. Generalized Linear Models , 1992 .
[2] Graziano Pesole,et al. Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes , 2004, Nucleic Acids Res..
[3] S. W. Lam,et al. Goodness‐of‐Fit Tests for Normality , 2006 .
[4] William Stafford Noble,et al. Assessing computational tools for the discovery of transcription factor binding sites , 2005, Nature Biotechnology.
[5] Alexander E. Kel,et al. TRANSFAC®: transcriptional regulation, from patterns to profiles , 2003, Nucleic Acids Res..
[6] G. Stormo,et al. ANN-Spec: a method for discovering transcription factor binding sites with improved specificity. , 1999, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.
[7] D. Cox,et al. An Analysis of Transformations , 1964 .
[8] G. Church,et al. Computational identification of cis-regulatory elements associated with groups of functionally related genes in Saccharomyces cerevisiae. , 2000, Journal of molecular biology.
[9] Gary D. Stormo,et al. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences , 1999, Bioinform..
[10] Eric R. Ziegel,et al. Generalized Linear Models , 2002, Technometrics.
[11] R. Guigó,et al. Evaluation of gene structure prediction programs. , 1996, Genomics.
[12] Charles Elkan,et al. The Value of Prior Knowledge in Discovering Motifs with MEME , 1995, ISMB.
[13] Saurabh Sinha,et al. YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation , 2003, Nucleic Acids Res..