Supporting Information MARZ: an algorithm to combinatorially analyze gapped n-mer models of transcription factor binding
نویسندگان
چکیده
Figure S1: RZ Scores using the TFFMs for HB. The x-axis corresponds to the TFFM hit probability / score threshold used for each run. The y-axis corresponds to the RZ score obtained from each run. The RZ scores are highly dependent on the hit probability/score threshold used. More importantly, the highest scores obtained from the TFFMs are lower than those obtained from the best performing gapped n-mer (0.71).
منابع مشابه
A graph-based motif detection algorithm models complex nucleotide dependencies in transcription factor binding sites
Given a set of known binding sites for a specific transcription factor, it is possible to build a model of the transcription factor binding site, usually called a motif model, and use this model to search for other sites that bind the same transcription factor. Typically, this search is performed using a position-specific scoring matrix (PSSM), also known as a position weight matrix. In this pa...
متن کاملModelling the transcription factor DNA-binding affinity using genome-wide ChIP-based data
U nderstanding protein-DNA binding affinity is still a mystery for many transcription factors (TFs). Although several approaches have been proposed in the literature to model the DNA-binding specificity of TFs, they still have some limitations. Most of the methods require a cut-off threshold in order to classify a K-mer as a binding site (BS) and finding such a threshold is usually done by hand...
متن کاملA DNA based Approach to find Closed Repetitive Gapped Subsequences from a Sequence Database
In bioinformatics, the discovery of transcription factor binding affinities is important. This is done by sequence analysis of micro array data. The determination of continuous and gapped motifs accurately from the given long sequence of data, say genetic data is challenging and requires a detailed study. In this paper, we propose an algorithm that can be used for finding short continuous, shor...
متن کاملgkm-DNN: efficient prediction using gapped k-mer features and deep neural networks
How to extract informative features from genome sequence is a challenging issue. Gapped k-mers frequency vectors (gkm-fv) has been presented as a new type of features in the last few years. Coupled with support vector machine (gkm-SVM), gkm-fvs have been used to achieve an effective sequence-based prediction (e.g., transcription factor binding site prediction). However, the huge computation of ...
متن کاملNucleotide Interdependency in Transcription Factor Binding Sites in the Drosophila Genome
A long-standing objective in modern biology is to characterize the molecular components that drive the development of an organism. At the heart of eukaryotic development lies gene regulation. On the molecular level, much of the research in this field has focused on the binding of transcription factors (TFs) to regulatory regions in the genome known as cis-regulatory modules (CRMs). However, rel...
متن کامل