Evidence map›Paper›PMID 22662128›Full record

ArticlePloS one2012

GPUmotif: an ultra-fast and energy-efficient motif analysis program using graphics processing units.

Pooya Zandevakili, Ming Hu, Zhaohui Qin

Abstract read
In one paragraph

Article in PloS one, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
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

3 citing papers in PubMed.

  1. FisherMP: fully parallel algorithm for detecting combinatorial motifs from large ChIP-seq datasets.DNA research : an international journal for rapid publication of reports on genes and genomes · 2019
    Article
  2. Article
  3. Review
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

3 authors.

Pooya ZandevakiliComputer Science and Engineering Department, University of Michigan, Ann Arbor, Michigan, United States of America.
Ming Hu
Zhaohui Qin

Funding

Model-Based Methods for Analyzing ChIP Sequencing DataR01HG005119 · NHGRI · UNIVERSITY OF MICHIGAN AT ANN ARBOR · PI QIN, ZHAOHUI · 2009 to 2012
$1.2M
NHGRI NIH HHS R01 HG005119NHGRI NIH HHS R01HG005119
6 · The paper itself

Abstract

Computational detection of TF binding patterns has become an indispensable tool in functional genomics research. With the rapid advance of new sequencing technologies, large amounts of protein-DNA interaction data have been produced. Analyzing this data can provide substantial insight into the mechanisms of transcriptional regulation. However, the massive amount of sequence data presents daunting challenges. In our previous work, we have developed a novel algorithm called Hybrid Motif Sampler (HMS) that enables more scalable and accurate motif analysis. Despite much improvement, HMS is still time-consuming due to the requirement to calculate matching probabilities position-by-position. Using the NVIDIA CUDA toolkit, we developed a graphics processing unit (GPU)-accelerated motif analysis program named GPUmotif. We proposed a "fragmentation" technique to hide data transfer time between memories. Performance comparison studies showed that commonly-used model-based motif scan and de novo motif finding procedures such as HMS can be dramatically accelerated when running GPUmotif on NVIDIA graphics cards. As a result, energy consumption can also be greatly reduced when running motif analysis using GPUmotif. The GPUmotif program is freely available at http://sourceforge.net/projects/gpumotif/

Indexed as

Computer GraphicsNucleotide MotifsSoftwareAlgorithmsBinding SitesComputational BiologyInternetTranscription FactorsTranscription Factors

Identifiers

PMID22662128
PMCPMC3360745

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.