Evidence map›Paper›PMID 17927813›Full record

ArticleAlgorithms for molecular biology : AMB2007

Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules.

Valentina Boeva, Julien Clément, Mireille Régnier, Mikhail A Roytberg, Vsevolod J Makeev

Open access · goldAbstract read
In one paragraph

Article in Algorithms for molecular biology : AMB, 2007. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed
2.3field-weighted citation impact, top 12% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

11 citing papers in PubMed, 39 citations in OpenAlex.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Article
  6. The power of detecting enriched patterns: an HMM approach.Journal of computational biology : a journal of computational molecular cell biology · 2010
    Article
  7. Article
  8. Article
  9. Article
  10. Efficient exact motif discovery.Bioinformatics (Oxford, England) · 2009
    Article
  11. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors at 4 institutions in 2 countries.

Valentina BoevaInstitute of Genetics and Selection of Industrial Microorganisms, GosNIIGenetika, 117545 Moscow, Russia. valeyo@yandex.ru
Julien Clément
Mireille Régnier
Mikhail A Roytberg
Vsevolod J Makeev
Institut national de recherche en sciences et technologies du numérique · FREngelhardt Institute of Molecular Biology · RULaboratoire de Recherche en Informatique · FRPushchino State Institute of Natural Sciences · RU

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundcis-Regulatory modules (CRMs) of eukaryotic genes often contain multiple binding sites for transcription factors. The phenomenon that binding sites form clusters in CRMs is exploited in many algorithms to locate CRMs in a genome. This gives rise to the problem of calculating the statistical significance of the event that multiple sites, recognized by different factors, would be found simultaneously in a text of a fixed length. The main difficulty comes from overlapping occurrences of motifs. So far, no tools have been developed allowing the computation of p-values for simultaneous occurrences of different motifs which can overlap.

resultsWe developed and implemented an algorithm computing the p-value that s different motifs occur respectively k1, ..., ks or more times, possibly overlapping, in a random text. Motifs can be represented with a majority of popular motif models, but in all cases, without indels. Zero or first order Markov chains can be adopted as a model for the random text. The computational tool was tested on the set of cis-regulatory modules involved in D. melanogaster early development, for which there exists an annotation of binding sites for transcription factors. Our test allowed us to correctly identify transcription factors cooperatively/competitively binding to DNA.

methodThe algorithm that precisely computes the probability of simultaneous motif occurrences is inspired by the Aho-Corasick automaton and employs a prefix tree together with a transition function. The algorithm runs with the O(n|Sigma|m|H| + K|sigma|K) Piiki) time complexity, where n is the length of the text |Sigma| is the alphabet size, m is the maximal motif length, |H| is the total number of words in motifs, K is the order of Markov model, and ki is the number of occurrences of the ith motif.

conclusionThe primary objective of the program is to assess the likelihood that a given DNA segment is CRM regulated with a known set of regulatory factors. In addition, the program can also be used to select the appropriate threshold for PWM scanning. Another application is assessing similarity of different motifs. AVAILABILITY: Project web page, stand-alone version and documentation can be found at http://bioinform.genetika.ru/AhoPro/

Identifiers

PMID17927813
PMCPMC2174486
OpenAlexW2099800150

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.