2009
DOI: 10.1186/1471-2105-10-208
|View full text |Cite
|
Sign up to set email alerts
|

OHMM: a Hidden Markov Model accurately predicting the occupancy of a transcription factor with a self-overlapping binding motif

Abstract: Background: DNA sequence binding motifs for several important transcription factors happen to be self-overlapping. Many of the current regulatory site identification methods do not explicitly take into account the overlapping sites. Moreover, most methods use arbitrary thresholds and fail to provide a biophysical interpretation of statistical quantities. In addition, commonly used approaches do not include the location of a site with respect to the transcription start site (TSS) in an integrated probabilistic … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(14 citation statements)
references
References 92 publications
0
14
0
Order By: Relevance
“…By searching the sequences corresponding to these models in genomes with TFBS identification search engines, binding sites and target genes of TFs in the whole genome can be identified. At present, numerous such TFBS identification search engines have been developed, such as position-specific scoring matrix (Stormo 2000), dictionary model (Sabatti et al 2005), artificial neural network (Workman & Stormo 2000), hidden Markov model (Marinescu et al 2005, Drawid et al 2009), Bayesian network (Chen et al 2010), and P-Match (Chekmenev et al 2005).…”
Section: Dsdna Microarraymentioning
confidence: 99%
“…By searching the sequences corresponding to these models in genomes with TFBS identification search engines, binding sites and target genes of TFs in the whole genome can be identified. At present, numerous such TFBS identification search engines have been developed, such as position-specific scoring matrix (Stormo 2000), dictionary model (Sabatti et al 2005), artificial neural network (Workman & Stormo 2000), hidden Markov model (Marinescu et al 2005, Drawid et al 2009), Bayesian network (Chen et al 2010), and P-Match (Chekmenev et al 2005).…”
Section: Dsdna Microarraymentioning
confidence: 99%
“…Using the TFFMs, the probability of occupancy (Pocc) of a TF within a defined DNA sequence is obtained by multiplying the TFBS probabilities at each position (see Material and Methods section for details). This is a simpler approach than the physico-chemical models used in tools like GOMER [55] and TRAP [56], and somewhat similar in concept to the approach of OHMM [57] which uses HMMs to predict occupancy of TFs with self-overlapping binding motifs. To observe whether Pocc can improve the discriminative power of the TFFMs, Pocc have been computed from TFFMs and assessed for their capacity to discriminate between ChIP-seq data and background sequences and compared to original TFFMs using the best site per ChIP-seq peak to discriminate between ChIP-seq data and background sequences.…”
Section: Resultsmentioning
confidence: 99%
“…HMMs are powerful tools for analyzing sequential data [9,10] that have been adapted to binding site discovery [5,6]. HMMs model a system as a Markov process on internal states that are hidden and cannot be observed directly.…”
Section: Hmms For Binding Site Discoverymentioning
confidence: 99%
“…This points to a major shortcoming of PWM based methodsnamely the inability to learn a threshold directly from data. A major advantage of HMM models over PWM-only approached is that HMMs learn both a PWM, ǫ, and a natural "cutoff" through the chemical potential µ = log z [6]. In terms of the corresponding hardrod model, the probability, P bs (S), for a sequence, S, to be a binding site takes the form of a Fermi-function, If one makes the reasonable assumption that a sequence S is a binding site if P bs (S) > 1/2, we see that µ serves as a natural cut-off for binding site energies [6].…”
Section: B Hmms Position-weight Matrices and Cutoffsmentioning
confidence: 99%
See 1 more Smart Citation