• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. (2004)

by G Pavesi, P Mereghetti, G Mauri, G Pesole
Venue:Nucleic Acids Res.
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 145
Next 10 →

STAMP: a web tool for exploring DNA-binding motif similarities.” Nucleic Acids Res, 35(Web Server issue

by Shaun Mahony, Panayiotis V. Benos , 2007
"... doi:10.1093/nar/gkm272 ..."
Abstract - Cited by 72 (1 self) - Add to MetaCart
doi:10.1093/nar/gkm272
(Show Context)

Citation Context

...fs in any given run]. Currently supported STAMP input formats include the output files from motif-finder programs like SOMBRERO (19), BioProspector (18), MDScan (20), AlignACE (21), MEME (22), Weeder =-=(23)-=-, MotifSampler (24), YMF (25), ANN-Spec (26), Consensus (27), Improbizer and Co-Bind (28). Examples of all supported formats are illustrated on STAMP’s help web page. Parameters The users may specify ...

TJ: NestedMICA: sensitive inference of over-represented motifs in nucleic acid sequence

by Thomas A. Down, Tim J. P. Hubbard - Nucleic Acids Res
"... NestedMICA is a new, scalable, pattern-discovery system for finding transcription factor binding sites and similar motifs in biological sequences. Like several previous methods, NestedMICA tackles this problem by optimizing a probabilistic mixture model to fit a set of sequences. However, the use of ..."
Abstract - Cited by 55 (1 self) - Add to MetaCart
NestedMICA is a new, scalable, pattern-discovery system for finding transcription factor binding sites and similar motifs in biological sequences. Like several previous methods, NestedMICA tackles this problem by optimizing a probabilistic mixture model to fit a set of sequences. However, the use of a newly developed inference strategy called Nested Sampling means NestedMICA is able to find optimal solutions without the need for a problematic initialization or seeding step. We investigate the performance of NestedMICA in a range scenario, on synthetic data and a well-characterized set of muscle regulatory regions, and compare it with the popular MEME program. We show that the new method is significantly more sensitive than MEME: in one case, it successfully extracted a target motif from background sequence four times longer than could be handled by the existing program. It also performs robustly on synthetic sequences containing multiple significant motifs. When tested on a real set of regulatory sequences, NestedMICA produced motifs which were good predictors for all five abundant classes of annotated binding sites.
(Show Context)

Citation Context

...21), we saw a correlation coefficient (nCC) of 0.149. This compares favourably with the winner of the assessment (both overall and on the human subset), an exhaustive enumeration method called Weeder =-=(22)-=-, which scored 0.115. For comparison, the best of the two MEME entries scored 0.034. The NestedMICA program has been designed to scale to large sets of data. It can run on symmetric multiprocessor mac...

On the immortality of television sets: ‘function’ in the human genome according to the evolution-free gospel of ENCODE.

by Dan Graur , Yichen Zheng , Nicholas Price , Ricardo B R Azevedo , Rebecca A Zufall , Eran Elhaik - Genome Biology and Evolution , 2013
"... ..."
Abstract - Cited by 36 (0 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...them, University of Chicago, SYDH (Stanford, Yale, University of Southern California, and Harvard) and Hudson Alpha Institute for Biotechnology, are 824, 457 and 535 nucleotides respectively. These mean lengths, which are highly statistically different from one another, are much larger than the actual sizes of all known transcription factor binding sites. So far, the vast majority of known transcription-factor binding sites were found to range in length from 6 to 14 nucleotides (Oliphant et al. 1989; Christy and Nathans 1989; Okkema and Fire 1994; Klemm et al. 1994; Loots and Ovcharenko 2004; Pavesi et al. 2004), which is 1–2 orders of magnitude smaller than the ENCODE estimate. (An exception to the 6-to-14-bp rule is the canonical p53 binding site, which is composed of two decamer half-sites that can be separated by up to 13 bp.) If we take 10 bp as the average length for a transcription factor binding site (Stewart and Plotkin 2012), instead of the ~600 bp used by ENCODE, the 8.5% value may turn out to be ~8.5% × 10/600 = 0.14% or lower, depending on the proportion of false positives in their data. Interestingly, the DNA coverage value obtained by SYDH is ~18%. We were unable to identify the source...

MotifCut: regulatory motif finding with maximum density subgraphs bioinformatics

by Eugene Fratkin - In Proceedings of International Conference on Intelligent Systems and Molecular Biology , 2006
"... doi:10.1093/bioinformatics/btl243BIOINFORMATICS ..."
Abstract - Cited by 22 (4 self) - Add to MetaCart
doi:10.1093/bioinformatics/btl243BIOINFORMATICS
(Show Context)

Citation Context

...in et al., 2002; Favorov et al., 2004; Frith et al., 2004; Gordon et al., 2005; Hertz et al., 1999; Hughes et al., 2000; Liang et al., 2004; Keich et al., 2002; Liu et al., 2001; Mahony et al., 2005; =-=Pavesi et al., 2004-=-; Pevzner et al., 2000; Sinha et al., 2004, 2003; Stormo et al., 1989; Thijs et al., 2001; Van Helden et al., 1998; Wang et al., 2003; Workman et al., 2000). A thorough examination of the field has al...

Efficient and Accurate Discovery of Patterns in Sequence Data Sets

by Avrilia Floratou, Jignesh M. Patel - IEEE Transactions On Knowledge and Data Engineering , 2011
"... Abstract — Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require efficient mining of “approximate ” patterns that are contiguous. The few existing algorithms that can be applied to ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
Abstract — Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require efficient mining of “approximate ” patterns that are contiguous. The few existing algorithms that can be applied to find such contiguous approximate pattern mining have drawbacks like poor scalability, lack of guarantees in finding the pattern, and difficulty in adapting to other applications. In this paper, we present a new algorithm called FLAME (FLexible and Accurate Motif DEtector). FLAME is a flexible suffix tree based algorithm that can be used to find frequent patterns with a variety of definitions of motif (pattern) models. It is also accurate, as it always find the pattern if it exists. Using both real and synthetic datasets, we demonstrate that FLAME is fast, scalable, and outperforms existing algorithms on a variety of performance metrics. Using FLAME, it is now possible to mine datasets that would have been prohibitively difficult with existing tools. I.

MoD Tools: regulatory motif discovery in nucleotide sequences from co-regulated or homologous genes

by Giulio Pavesi, Paolo Mereghetti, Federico Zambelli, Marco Stefani, Giancarlo Mauri, Graziano Pesole - Nucleic Acids Res , 2006
"... sequences from co-regulated or homologous genes ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
sequences from co-regulated or homologous genes
(Show Context)

Citation Context

...t be taken into account (2). The MOtif Discovery (MoD) Tools web server provides access to software tools for the discovery of novel motifs that cover these aspects and approaches. It includes Weeder =-=(6,7)-=-, for the discovery of conserved motifs in sequences from co-regulated genes; WeederH, for the discovery of motifs and distal motif modules in sequences from homologous genes; and RNAprofile (8), for ...

Efficient exact motif discovery

by Tobias Marschall, Sven Rahmann - VOL. 25 ISMB 2009, PAGES I356–I364 , 2009
"... ..."
Abstract - Cited by 12 (6 self) - Add to MetaCart
Abstract not found

Localized motif discovery in gene regulatory sequences

by Vipin Narang, Ankush Mittal, Wing-kin Sung , 2010
"... Motivation: Discovery of nucleotide motifs that are localized with respect to a certain biological landmark is important in several appli-cations, such as in regulatory sequences flanking the transcription start site, in the neighborhood of known transcription factor binding sites, and in transcript ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
Motivation: Discovery of nucleotide motifs that are localized with respect to a certain biological landmark is important in several appli-cations, such as in regulatory sequences flanking the transcription start site, in the neighborhood of known transcription factor binding sites, and in transcription factor binding regions discovered by massively parallel sequencing (ChIP-Seq). Results: We report an algorithm called LocalMotif to discover such localized motifs. The algorithm is based on a novel scoring function, called spatial confinement score, which can determine the exact interval of localization of a motif. This score is combined with other existing scoring measures including over-representation and relative entropy to determine the overall prominence of the motif. The approach successfully discovers biologically relevant motifs and their intervals of localization in scenarios where the motifs cannot be discovered by general motif finding tools. It is especially useful for discovering multiple co-localized motifs in a set of regulatory sequences, such as those identified by ChIP-Seq. Availability and Implementation: The LocalMotif software is available at

SPACER: Identification of cis-regulatory elements with noncontiguous

by Arijit Chakravarty, Jonathan M. Carlson, Radhika S. Khetani, Charles E. Deziel, Robert H. Gross
"... critical residues ..."
Abstract - Cited by 9 (5 self) - Add to MetaCart
critical residues
(Show Context)

Citation Context

...nner of Tompa et al.’s (2005) recent expert-user performance comparison, was run only on the Zn(II)2Cys6 regulons, as background sequences for the bacterial organisms were not available on WeederWeb (=-=Pavesi et al., 2004-=-). We used the evaluation criteria originally put forth by Sinha and Tompa (2003). In head-to-head comparisons, SPACER outperformed all 10 programs by a number of criteria (Supplementary Table 1). SPA...

Evolutionary divergence and limits of conserved non-coding sequence detection

by Anna R. Reineke, Erich Bornberg-bauer, Jenny Gu , 2010
"... in plant genomes ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
in plant genomes
(Show Context)

Citation Context

...ation of motifs. These algorithms include MEME (29), MotifSampler (30) and AlignACE (31). Improvements in recent algorithms are often achieved through flexible search parameters (32,33), suffix-trees =-=(34)-=-, development of mixed-models (35,36), aided analysis with supplementary high-throughput experimental data (30,37–39), prior knowledge of transcription factor binding site features (40–42), implementa...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University