This software package grew out of the work that I did to obtain my PhD. If it is of help for your analysis, please cite
@Manual{,
title = {motifcounter: R package for analysing TFBSs in DNA sequences},
author = {Wolfgang Kopp},
year = {2016},
note = {R package version 0.99.0},
}
1 Usage examples
# Estimate a background model on a set of sequences
bg <- readBackground(sequences, order)
# Normalize a given PFM
new_motif <- normalizeMotif(motif)
# Evaluate the scores along a given sequence
scores <- scoreSequence(sequence, motif, bg)
# Evaluate the motif hits along a given sequence
hits <- motifHits(sequence, motif, bg)
# Evaluate the average score profile
average_scores <- scoreProfile(sequences, motif, bg)
# Evaluate the average motif hit profile
average_hits <- motifHitProfile(sequences, motif, bg)
# Compute the motif hit enrichment
enrichment_result <- motifEnrichment(sequences, motif, bg)
2 Introduction
2.1 Biological background
Transcription factors (TFs) play a crucial role in gene regulation. They function by recognizing and binding to specific DNA stretches that are usually 5-30bp in length which are referred to as transcription factor binding sites (TFBSs). TF-binding acts on the neighboring genes by up- or down-regulating their gene expression levels.
The aim of the motifcounter
package is to provide statistical tools for studying putative TFBSs in given DNA sequence, including the presence and location of TFBSs and the enrichment of TFBSs.
2.2 Hallmarks of motifcounter
The main ingredients for an analysis with motifcounter
consist of
- a position frequency matrix (PFM) (also called TF motif)
- a background model that serves as a reference for the statistical analysis
- a set of DNA sequences that is subject to the TFBS analysis
- a false positive probability \(\alpha\) for predicting TFBSs in a random sequence. E.g. \(\alpha=0.001\).
A PFM represents the affinity of a TF to bind a certain DNA segment. A large set of known PFMs can be acquired e.g. from the MotifDb
package [@motifdb]. On the other hand, the background model defines the properties of unbound DNA sequences. motifcounter
implements the background model as an order-\(d\) Markov model, where \(d\) is prescribed by the user. The advantage of using higher-order background models is that they are able to capture higher-order sequence features which is crucial for studying naturally occurring DNA sequences that are rich in such features (e.g. in CpGs islands).
Using the PFM and the background model, motifcounter
computes the motif score for a given DNA sequence, which is defined to be the log-likelihood ratio between the PFM and the background. The motif score represents a measure that indicates whether a certain position in the DNA sequence is bound or unbound by the TF. Intuitively, the higher the score, the more like does the sequence represent a TFBS.
The motif scores are also used to determine motif hits (e.g. putative TFBSs) in the DNA sequence. To this end, motifcounter
uses a predetermined score threshold and calls putative TFBSs whenever the observed score at a give position is greater or equal to the score threshold. motifcounter
establishes the score threshold automatically based on 1) the score distribution and 2) the user-prescribed false positive level \(\alpha\). To this end, the score distribution is determined by an efficient dynamic programming algorithm for general order-\(d\) background models, similar as described in [@rahmann, @rsat1].
Testing for motif hit enrichment in motifcounter
is based on the number of motif hits that are observed in a set of DNA sequences. In order to be able to judge significance of the observed number of hits (e.g. 10 predicted TFBSs in the sequence of length 10kb), the package approximates the distribution of the number of motif hits in random DNA sequences with matched lengths.
Accordingly, motifcounter
provides two fast, accurate alternatives for approximating this distribution:
- A compound Poisson approximation
- a combinatorial model
Both of those methods support higher-order background models and account for the self-overlapping structure of the motif, which could lead to mutually overlapping motif hits, which
are referred to as clumps [@reinert, @pape]1. Clumping is characteristic for self-overlapping motifs, including repeat-like motifs or palindromic motifs. motifcounter
not only account for overlapping motif hits with respect to a single DNA strand, but also for overlapping reverse complementary hits, if both DNA strands are scanned for motif hits. It is essential to account for clumping, as that influences the distribution of the number of motif hits and thereby the motif hit enrichment test. Ignoring this effect could cause misleading statistical conclusions.
The compound Poisson model in motifcounter
is based on an improvement upon [@pape], which was extended to support order-\(d\) background models and uses a refined way to determine the clump size distribution.
On the other hand, the combinatorial model is based on summing over all permutations of placing the \(k\) hits in a finite-length sequence, which employs an efficient dynamic programming algorithm, related to the approach proposed by [@zhang]2.
3 Getting started
3.1 Preliminary steps
3.1.1 Acquire a background model
The background model is used to specify the properties of unbound DNA sequences. That is, it plays a role as a reference for identifying putative TFBSs as well as for judging motif hit enrichment.
In motifcounter
, offers the opportunity to use order-\(d\) Markov model with user-defined \(d\). The background model is estimated on a set of user-provided DNA sequences which are supplied as DNAStringSet
-objects from the Biostrings
Bioconductor package.
The following code fragment illustrates how an order-\(1\) background model is estimated from a given set of DNA sequences:
order <- 1
file <- system.file("extdata", "seq.fasta", package = "motifcounter")
seqs <- Biostrings::readDNAStringSet(file)
bg <- readBackground(seqs, order)
Hint: Ideally, the DNA sequence for estimating the background model should be representative (or even the same) as the sequences that are latter analysed (e.g. for motif hit enrichment).
Hint: While, higher-order models tend to be more accurate for representing the naturally occurring DNA sequence, they come at a higher computational cost. As a compromise, we recommend to use orders \(d=1\) or \(d=2\).
3.1.2 Acquire a motif
motifcounter
handles motifs in terms of position frequency matrices (PFMs), which are commonly used to represent the binding affinity of transcription factors (TFs).
A convenient source of known motifs is the MotifDb
Bioconductor package [@motifdb], which shall be the basis for our tutorial. For example, we retrieve the motif for the human Pou5f1 (or Oct4) transcription factor as follows
# Extract the Oct4 motif from MotifDb
library(MotifDb)
oct4 <- as.list(query(query(query(MotifDb, "hsapiens"),
"pou5f1"), "jolma2013"))[[1]]
motif <- oct4
# Visualize the motif using seqLogo
library(seqLogo)
seqLogo(motif)
Hint: motifcounter
requires strictly positive entries for a PFM. If this is not the case, the package provides the function normalizeMotif
, which adds pseudo-observations and re-normalize the columns:
new_motif <- normalizeMotif(motif)
3.1.3 Optional settings
By default, motifcounter
identifies TFBS with a the false positive probability of \(\alpha=0.001\). The user might want to change the stringency level of \(\alpha\), which is facilitated by motifcounterOptions
:
alpha <- 0.01
motifcounterOptions(alpha)
For other global options of motifcounter
, please consult ?motifcounterOptions
for more information.
3.2 Retrieve position- and strand-specific scores and hits
For the following example, we explore the DNA sequences of a set of Oct4-ChIP-seq peaks that were obtained in human hESC by the ENCODE project [@encode2012]. The peak regions were trimmed to 200 bps.
file <- system.file("extdata", "oct4_chipseq.fa", package = "motifcounter")
oct4peaks <- Biostrings::readDNAStringSet(file)
3.2.1 Analysis of individual DNA sequences
The motifcounter
package provides functions for exploring position- and strand-specific putative TFBSs in individual DNA sequences. One way to explore a given DNA sequence for TFBSs is by utilizing scoreSequence
. This function returns the per position and strand scores for a given Biostring::DNAString
-object (left panel below). To put the observed scores into perspective, the right panel shows the theoretical score distribution in random sequences, which is obtained by scoreDist
3. Scores at the tail of the distribution occur very rarely by chance. Those are also the ones that give rise to TFBS predictions:
# Determine the per-position and per-strand scores
scores <- scoreSequence(oct4peaks[[1]], motif, bg)
# As a comparison, compute the theoretical score distribution
sd <- scoreDist(motif, bg)
par(mfrow = c(1, 2))
# Plot the observed scores, per position and per strand
plot(1:length(scores$fscores), scores$fscores, type = "l",
col = "blue", xlab = "position", ylab = "score",
ylim = c(min(sd$score), max(sd$score)), xlim = c(1, 250))
points(scores$rscores, col = "red", type = "l")
legend("topright", c("forw.", "rev."), col = c("blue", "red"), lty = c(1, 1))
# Plot the theoretical score distribution for the comparison
plot(sd$dist, sd$scores, type = "l", xlab = "probability", ylab = "")
To obtain the predicted TFBSs positions and strands, motifcounter
provides the function motifHits
. This function, applies a score threshold4 for calling the motif hits based on the observed scores.
# Call putative TFBSs
mhits <- motifHits(oct4peaks[[1]], motif, bg)
# Inspect the result
fhitpos <- which(mhits$fhits == 1)
rhitpos <- which(mhits$rhits == 1)
fhitpos
## integer(0)
rhitpos
## [1] 94
In the example sequence, we obtain no motif hit on the forward strand and one motif hit on the reverse strand at position 94. The underlying DNA sequence at this hit can be retrieved by
oct4peaks[[1]][rhitpos:(rhitpos + ncol(motif) - 1)]
## 9-letter "DNAString" instance
## seq: ATTTACATA
Next, we illustrate how a relaxed stringency level influences the number of motif hits. Using motifcounterOptions
, we prescribe a false positive probability of \(\alpha=0.01\) (the default was \(\alpha=0.001\)). This will increase the tendency of producing motif hits
# Prescribe a new false positive level for calling TFBSs
motifcounterOptions(alpha = 0.01)
# Determine TFBSs
mhits <- motifHits(oct4peaks[[1]], motif, bg)
fhitpos <- which(mhits$fhits == 1)
rhitpos <- which(mhits$rhits == 1)
fhitpos
## [1] 54 87 93 112
rhitpos
## [1] 55 94 111 118
Now we obtain four hits on each strand.
3.2.2 Analysis of a set of DNA sequences
While, scoreSequence
and motifHits
can be applied to study TFBSs in a single DNA sequence (given by a DNAString
-object), one might also be interested in the average score or motif hit profiles across multiple sequences of equal length. This might reveal positional constraints of the motif occurrences with respect to e.g. the TSS, or the summit of ChIP-seq peaks. On the one hand, motifcounter
provides the method scoreProfile
which can be applied for Biostrings::DNAStringSet
-objects.
# Determine the average score profile across all Oct4 binding sites
scores <- scoreProfile(oct4peaks, motif, bg)
plot(1:length(scores$fscores), scores$fscores, type = "l",
col = "blue", xlab = "position", ylab = "score")
points(scores$rscores, col = "red", type = "l")
legend("bottomleft", legend = c("forward", "reverse"),
col = c("blue", "red"), lty = c(1, 1))
On the other hand, motifHitProfile
constructs a similar profile by computing the position and strand specific mean motif hit frequency
motifcounterOptions() # let's use the default alpha=0.001 again
# Determine the average motif hit profile
mhits <- motifHitProfile(oct4peaks, motif, bg)
plot(1:length(mhits$fhits), mhits$fhits, type = "l",
col = "blue", xlab = "position", ylab = "score")
points(mhits$rhits, col = "red", type = "l")
legend("bottomleft", legend = c("forward", "reverse"),
col = c("blue", "red"), lty = c(1, 1))
3.3 Test for motif hit enrichment
A central feature of motifcounter
represents a sophisticated novel approach for identifying motif hit enrichment in DNA sequences.
To this end, the package contains the method motifEnrichment
, which evaluates the P-value associated with the number of motif hits that are found in the observed sequence, compared to the background model.
# Enrichment of Oct4 in Oct4-ChIP-seq peaks
result <- motifEnrichment(oct4peaks[1:10], motif, bg)
result
## $pvalue
## [1] 6.624993e-07
##
## $fold
## [1] 4.710889
The method returns a list that contains pvalue
as well as fold
. While, the pvalue
represents the probability that more or equally many hits are produced in random DNA sequences, fold
represents the fold-enrichment of motif hits relative the expected number of hits in random DNA sequences. That is, it represents a measure of the effect size.
Hint: In case, very long or many DNA sequences are scanned for TFBSs, the underlying distribution of the number of motif hits, which is the basis for the P-value-estimate, will be very narrow. In that case, the tiniest differences between the observed and the expected number of hits are prone to cause very low P-values. In that case, check it the fold-enrichment points to an reasonable effect size.
Hint: By default, motifEnrichment
scans both DNA strands for motif hits and draws its statistical conclusions based on the compound Poisson model. However, motif enrichment can also be performed with respect to scanning single strands (e.g. when analyzing RNA sequences). Please consult ?motifEnrichment
for the single strand option.
Hint: motifEnrichment
may optionally invoke two alternative approaches for approximating the P-value, 1) by a compound Poisson approxmiation and 2) by a combinatorial approximation (see ?motifEnrichment
). As a rule of thumb, we recommend the use compound Poisson model for studying long (or many ) DNA sequences with a fairly stringent \(\alpha\) (e.g. 0.001 or smaller). On the other hand, a relaxed \(\alpha\) is more desirable for your analysis (e.g \(\alpha\geq 0.01\)), we recommend the computationally more costly, but also more accurate combinatorial approximation.
4 Session Info
sessionInfo()
## R version 3.4.0 (2017-04-21)
## Platform: x86_64-pc-linux-gnu (64-bit)
## Running under: Ubuntu 16.04.2 LTS
##
## Matrix products: default
## BLAS: /home/biocbuild/bbs-3.5-bioc/R/lib/libRblas.so
## LAPACK: /home/biocbuild/bbs-3.5-bioc/R/lib/libRlapack.so
##
## locale:
## [1] LC_CTYPE=en_US.UTF-8 LC_NUMERIC=C
## [3] LC_TIME=en_US.UTF-8 LC_COLLATE=C
## [5] LC_MONETARY=en_US.UTF-8 LC_MESSAGES=en_US.UTF-8
## [7] LC_PAPER=en_US.UTF-8 LC_NAME=C
## [9] LC_ADDRESS=C LC_TELEPHONE=C
## [11] LC_MEASUREMENT=en_US.UTF-8 LC_IDENTIFICATION=C
##
## attached base packages:
## [1] grid stats4 parallel stats graphics grDevices utils
## [8] datasets methods base
##
## other attached packages:
## [1] seqLogo_1.42.0 MotifDb_1.18.0 Biostrings_2.44.0
## [4] XVector_0.16.0 IRanges_2.10.0 S4Vectors_0.14.0
## [7] BiocGenerics_0.22.0 motifcounter_1.0.0 knitr_1.15.1
##
## loaded via a namespace (and not attached):
## [1] Rcpp_0.12.10 magrittr_1.5
## [3] GenomicAlignments_1.12.0 GenomicRanges_1.28.0
## [5] zlibbioc_1.22.0 BiocParallel_1.10.0
## [7] lattice_0.20-35 GenomeInfoDb_1.12.0
## [9] stringr_1.2.0 tools_3.4.0
## [11] SummarizedExperiment_1.6.0 Biobase_2.36.0
## [13] matrixStats_0.52.2 htmltools_0.3.5
## [15] yaml_2.1.14 rprojroot_1.2
## [17] digest_0.6.12 Matrix_1.2-9
## [19] GenomeInfoDbData_0.99.0 rtracklayer_1.36.0
## [21] bitops_1.0-6 prettydoc_0.2.0
## [23] RCurl_1.95-4.8 evaluate_0.10
## [25] rmarkdown_1.4 DelayedArray_0.2.0
## [27] stringi_1.1.5 compiler_3.4.0
## [29] Rsamtools_1.28.0 backports_1.0.5
## [31] XML_3.98-1.6
This is in contrast to the simple binomial approximation which was suggested in several publications [@rsat1,@rahmann]↩
By contrast,
motifcounter
does not seek to enumerate all compatible words that give rise to motif hits, of which there might be exponentially many depending on the motif length, but is it rather based on a fast approximation of overlapping hit probabilities. This makes the combinatorial approximation applicable for arbitrary motif lengths, motif structures and choices of \(\alpha\)↩The score distribution is computed using an efficient dynamic programming algorithm.↩
The threshold is obtained for a user-defined false positive level \(\alpha\) (e.g. \(\alpha=0.001\)), which is determined from the theoretical score distribution.↩