Evidence map›Paper›PMID 27482905›Full record

ArticlePloS one2016

GPU-Acceleration of Sequence Homology Searches with Database Subsequence Clustering.

Shuji Suzuki, Masanori Kakuta, Takashi Ishida, Yutaka Akiyama

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
4citing 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

4 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. 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

4 authors.

Shuji SuzukiGraduate School of Information Science and Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan.
Masanori KakutaGraduate School of Information Science and Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan.
Takashi IshidaGraduate School of Information Science and Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan.
Yutaka AkiyamaGraduate School of Information Science and Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Sequence homology searches are used in various fields and require large amounts of computation time, especially for metagenomic analysis, owing to the large number of queries and the database size. To accelerate computing analyses, graphics processing units (GPUs) are widely used as a low-cost, high-performance computing platform. Therefore, we mapped the time-consuming steps involved in GHOSTZ, which is a state-of-the-art homology search algorithm for protein sequences, onto a GPU and implemented it as GHOSTZ-GPU. In addition, we optimized memory access for GPU calculations and for communication between the CPU and GPU. As per results of the evaluation test involving metagenomic data, GHOSTZ-GPU with 12 CPU threads and 1 GPU was approximately 3.0- to 4.1-fold faster than GHOSTZ with 12 CPU threads. Moreover, GHOSTZ-GPU with 12 CPU threads and 3 GPUs was approximately 5.8- to 7.7-fold faster than GHOSTZ with 12 CPU threads.

Indexed as

Computing MethodologiesSequence HomologySoftwareAlgorithmsAnimalsCluster AnalysisComputer GraphicsDatabases, GeneticDNAHumansMetagenomicsProteinsTime FactorsDNAProteins

Identifiers

PMID27482905
PMCPMC4970815

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.