For each position i of the sequence the log-likelihood ratio score of the length-w window is \(score(i) = \sum_j \log_2(p(b_{i+j-1}, j) / bg(b))\), where p(b, j) is the motif probability of base b at column j and bg the zero-order background. Scores are converted to p-values \(P(S \ge score)\) with the Staden (1994) dynamic-programming distribution of the discretized score (integer grid of 1/scale bits), as in FIMO. Scanning is single-strand.
Value
List with scores, pvalues,
best_score, best_pvalue, best_position
(0-based), width, n_windows, method.
References
Grant, C. E., Bailey, T. L. and Noble, W. S. (2011), FIMO: scanning for occurrences of a given motif, Bioinformatics 27(7), 1017-1018 (score and dynamic-programming p-values, Methods). Staden, R. (1994), Searching for motifs in nucleic acid sequences, Methods in Molecular Biology 25, 93-102.
