FOOTER analyses a pair of homologous mammalian DNA sequences (i.e. human and mouse/rat) for high probability binding sites of known transcription factors. A set of Position-Specific Scoring Matrices (PSSM) has been carefully constructed from mammalian transcription factor binding sites deposited in TRANSFAC database.
BaalChIP ( Bayesian Analysis of Allelic imbalances from ChIP-seq data) corrects for the effect of background allele frequency on the observed ChIP-seq read counts jointly analyses multiple ChIP-seq samples across a single variant.
ChIPModule is a software tool for systematical discoveray of transcription factors and their cofactors from ChIP-seq data. Given a ChIP-seq dataset and motifs of a large number of transcription factors, ChIPModule can efficiently identify groups of motifs,whose instances significantly co-occur in the ChIP-seq peak regions.
TFBS Evo is a model which traces the evolution of lineage-specific transcription factor binding sites without relying on detailed base-by-base cross-species alignments.
ZifNet is the package that can be used to predict the DNA binding model for any given a C2H2 zinc finger based on back-propagation algorithm. It includes two parts: First, identify the optimal DNA-zinc finger interaction model with the core C programs of ZifNet. And second, predict DNA-binding weight matrix models for Zinc fingers using the auxiliary codes, and the defined DNA-zinc finger interaction model derived from the last step.
::DEVELOPER
Stormo Lab in Department of Genetics, Washington University
DME (Discriminating Motif Enumerator) is a program that discovers transcription factor binding site motifs in nucleotide sequences. DME identifies motifs, represented as position weight matrices, that are overrepresented in one set of sequences relative to another set. The ability to directly optimize relative overrepresentation is a unique feature of DME, making DME an ideal tool for analyzing promoters of transcripts found to have differential expression in a particular context. The optimization procedure is based on an enumerative algorithm that is guaranteed to identify optimal motifs from a discrete space of matrices with a specific lower bound on information content. This strategy scales very well with the number and length of the sequences used, and is well-suited to analyzing very large data sets.