SCOPE:: a web server for practical de novo motif discovery

被引:80
作者
Carlson, Jonathan M. [3 ]
Chakravarty, Arijit [2 ]
DeZiel, Charles E. [1 ]
Gross, Robert H. [1 ]
机构
[1] Dartmouth Coll, Dept Biol Sci, Hanover, NH 03755 USA
[2] Millennium Pharmaceut Inc, Dept Canc Pharmacol, Cambridge, MA USA
[3] Univ Washington, Dept Comp Sci & Engn, Seattle, WA 98195 USA
基金
美国国家科学基金会;
关键词
D O I
10.1093/nar/gkm310
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
SCOPE is a novel parameter-free method for the de novo identification of potential regulatory motifs in sets of coordinately regulated genes. The SCOPE algorithm combines the output of three component algorithms, each designed to identify a particular class of motifs. Using an ensemble learning approach, SCOPE identifies the best candidate motifs from its component algorithms. In tests on experimentally determined datasets, SCOPE identified motifs with a significantly higher level of accuracy than a number of other web-based motif finders run with their default parameters. Because SCOPE has no adjustable parameters, the web server has an intuitive interface, requiring only a set of gene names or FASTA sequences and a choice of species. The most significant motifs found by SCOPE are displayed graphically on the main results page with a table containing summary statistics for each motif. Detailed motif information, including the sequence logo, PWM, consensus sequence and specific matching sites can be viewed through a single click on a motif. SCOPE's efficient, parameter-free search strategy has enabled the development of a web server that is readily accessible to the practising biologist while providing results that compare favorably with those of other motif finders. The SCOPE web server is at <http://genie.dartmouth.edu/scope>.
引用
收藏
页码:W259 / W264
页数:6
相关论文
共 11 条
[1]   Bounded search for de novo identification of degenerate cis-regulatory elements [J].
Carlson, Jonathan M. ;
Chakravarty, Arijit ;
Khetani, Radhika S. ;
Gross, Robert H. .
BMC BIOINFORMATICS, 2006, 7 (1)
[2]   BEAM: A beam search algorithm for the identification of Cis-regulatory elements in groups of genes [J].
Carlson, Jonathan M. ;
Chakravarty, Arijit ;
Gross, Robert H. .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (03) :686-701
[3]  
CHAKRAVARTY A, 2007, IN PRESS BIOINFORMAT
[4]   WebLogo: A sequence logo generator [J].
Crooks, GE ;
Hon, G ;
Chandonia, JM ;
Brenner, SE .
GENOME RESEARCH, 2004, 14 (06) :1188-1190
[5]   Computational identification of transcriptional regulatory elements in DNA sequence [J].
GuhaThakurta, Debraj .
NUCLEIC ACIDS RESEARCH, 2006, 34 (12) :3585-3598
[6]   Limitations and potentials of current motif discovery algorithms [J].
Hu, JJ ;
Li, B ;
Kihara, D .
NUCLEIC ACIDS RESEARCH, 2005, 33 (15) :4899-4913
[7]   An algorithm for finding protein-DNA binding sites with applications to chromatin-immunoprecipitation microarray experiments [J].
Liu, XS ;
Brutlag, DL ;
Liu, JS .
NATURE BIOTECHNOLOGY, 2002, 20 (08) :835-839
[8]   Practical strategies for discovering regulatory DNA sequence motifs [J].
MacIsaac, Kenzie D. ;
Fraenkel, Ernest .
PLOS COMPUTATIONAL BIOLOGY, 2006, 2 (04) :201-210
[9]   A survey of motif discovery methods in an integrated framework [J].
Sandve, Geir Kjetil ;
Drablos, Finn .
BIOLOGY DIRECT, 2006, 1 (1)
[10]   Assessing computational tools for the discovery of transcription factor binding sites [J].
Tompa, M ;
Li, N ;
Bailey, TL ;
Church, GM ;
De Moor, B ;
Eskin, E ;
Favorov, AV ;
Frith, MC ;
Fu, YT ;
Kent, WJ ;
Makeev, VJ ;
Mironov, AA ;
Noble, WS ;
Pavesi, G ;
Pesole, G ;
Régnier, M ;
Simonis, N ;
Sinha, S ;
Thijs, G ;
van Helden, J ;
Vandenbogaert, M ;
Weng, ZP ;
Workman, C ;
Ye, C ;
Zhu, Z .
NATURE BIOTECHNOLOGY, 2005, 23 (01) :137-144