Dataset Information

CLAST: CUDA implemented large-scale alignment search tool.

ABSTRACT: BACKGROUND: Metagenomics is a powerful methodology to study microbial communities, but it is highly dependent on nucleotide sequence similarity searching against sequence databases. Metagenomic analyses with next-generation sequencing technologies produce enormous numbers of reads from microbial communities, and many reads are derived from microbes whose genomes have not yet been sequenced, limiting the usefulness of existing sequence similarity search tools. Therefore, there is a clear need for a sequence similarity search tool that can rapidly detect weak similarity in large datasets. RESULTS: We developed a tool, which we named CLAST (CUDA implemented large-scale alignment search tool), that enables analyses of millions of reads and thousands of reference genome sequences, and runs on NVIDIA Fermi architecture graphics processing units. CLAST has four main advantages over existing alignment tools. First, CLAST was capable of identifying sequence similarities ~80.8 times faster than BLAST and 9.6 times faster than BLAT. Second, CLAST executes global alignment as the default (local alignment is also an option), enabling CLAST to assign reads to taxonomic and functional groups based on evolutionarily distant nucleotide sequences with high accuracy. Third, CLAST does not need a preprocessed sequence database like Burrows-Wheeler Transform-based tools, and this enables CLAST to incorporate large, frequently updated sequence databases. Fourth, CLAST requires <2 GB of main memory, making it possible to run CLAST on a standard desktop computer or server node. CONCLUSIONS: CLAST achieved very high speed (similar to the Burrows-Wheeler Transform-based Bowtie 2 for long reads) and sensitivity (equal to BLAST, BLAT, and FR-HIT) without the need for extensive database preprocessing or a specialized computing platform. Our results demonstrate that CLAST has the potential to be one of the most powerful and realistic approaches to analyze the massive amount of sequence data from next-generation sequencing technologies.

SUBMITTER: Yano M

PROVIDER: S-EPMC4271471 | biostudies-literature | 2014

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

CLAST: CUDA implemented large-scale alignment search tool.

Yano Masahiro M Mori Hiroshi H Akiyama Yutaka Y Yamada Takuji T Kurokawa Ken K

BMC bioinformatics 20141211

<h4>Background</h4>Metagenomics is a powerful methodology to study microbial communities, but it is highly dependent on nucleotide sequence similarity searching against sequence databases. Metagenomic analyses with next-generation sequencing technologies produce enormous numbers of reads from microbial communities, and many reads are derived from microbes whose genomes have not yet been sequenced, limiting the usefulness of existing sequence similarity search tools. Therefore, there is a clear n ...[more]

PMID: 25495907

Similar Datasets

Project description:The survival rate of cardiac arrest patients is less than 10%; therefore, development of a therapeutic strategy that improves their prognosis is necessary. Herein, we searched data collected from medical facilities throughout Japan for drugs that improve the survival rate of cardiac arrest patients. Candidate drugs, which could improve the prognosis of cardiac arrest patients, were extracted using "TargetMine," a drug discovery tool. We investigated whether the candidate drugs were among the drugs administered within 1 month after cardiac arrest in data of cardiac arrest cases obtained from the Japan Medical Data Center. Logistic regression analysis was performed, with the explanatory variables being the presence or absence of the administration of those candidate drugs that were administered to ≥10 patients and the objective variable being the "survival discharge." Adjusted odds ratios for survival discharge were calculated using propensity scores for drugs that significantly improved the proportion of survival discharge; the influence of covariates, such as patient background, medical history, and treatment factors, was excluded by the inverse probability-of-treatment weighted method. Using the search strategy, we extracted 165 drugs with vasodilator activity as candidate drugs. Drugs not approved in Japan, oral medicines, and external medicines were excluded. Then, we investigated whether the candidate drugs were administered to the 2,227 cardiac arrest patients included in this study. The results of the logistic regression analysis showed that three (isosorbide dinitrate, nitroglycerin, and nicardipine) of seven drugs that were administered to ≥10 patients showed significant association with improvement in the proportion of survival discharge. Further analyses using propensity scores revealed that the adjusted odds ratios for survival discharge for patients administered isosorbide dinitrate, nitroglycerin, and nicardipine were 3.35, 5.44, and 4.58, respectively. Thus, it can be suggested that isosorbide dinitrate, nitroglycerin, and nicardipine could be novel therapeutic agents for improving the prognosis of cardiac arrest patients.

Project description:BackgroundSearching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more than 25 years. It is based on a dynamic programming approach that explores all the possible alignments between two sequences; as a result it returns the optimal local alignment. Unfortunately, the computational cost is very high, requiring a number of operations proportional to the product of the length of two sequences. Furthermore, the exponential growth of protein and DNA databases makes the Smith-Waterman algorithm unrealistic for searching similarities in large sets of sequences. For these reasons heuristic approaches such as those implemented in FASTA and BLAST tend to be preferred, allowing faster execution times at the cost of reduced sensitivity. The main motivation of our work is to exploit the huge computational power of commonly available graphic cards, to develop high performance solutions for sequence alignment.ResultsIn this paper we present what we believe is the fastest solution of the exact Smith-Waterman algorithm running on commodity hardware. It is implemented in the recently released CUDA programming environment by NVidia. CUDA allows direct access to the hardware primitives of the last-generation Graphics Processing Units (GPU) G80. Speeds of more than 3.5 GCUPS (Giga Cell Updates Per Second) are achieved on a workstation running two GeForce 8800 GTX. Exhaustive tests have been done to compare our implementation to SSEARCH and BLAST, running on a 3 GHz Intel Pentium IV processor. Our solution was also compared to a recently published GPU implementation and to a Single Instruction Multiple Data (SIMD) solution. These tests show that our implementation performs from 2 to 30 times faster than any other previous attempt available on commodity hardware.ConclusionsThe results show that graphic cards are now sufficiently advanced to be used as efficient hardware accelerators for sequence alignment. Their performance is better than any alternative available on commodity hardware platforms. The solution presented in this paper allows large scale alignments to be performed at low cost, using the exact Smith-Waterman algorithm instead of the largely adopted heuristic approaches.

Dataset Information

CLAST: CUDA implemented large-scale alignment search tool.

Publications

CLAST: CUDA implemented large-scale alignment search tool.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets