scholarly journals The Design and Implementation of an Improved Lightweight BLASTP on CUDA GPU

Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2385
Author(s):  
Xue Sun ◽  
Chao-Chin Wu ◽  
Yan-Fang Liu

In the field of computational biology, sequence alignment is a very important methodology. BLAST is a very common tool for performing sequence alignment in bioinformatics provided by National Center for Biotechnology Information (NCBI) in the USA. The BLAST server receives tens of thousands of queries every day on average. Among the procedures of BLAST, the hit detection process whose core architecture is a lookup table is the most time-consuming. In the latest work, a lightweight BLASTP on CUDA GPU with a hybrid query-index table was proposed for servicing the sequence query length shorter than 512, which effectively improved the query efficiency. According to the reported protein sequence length distribution, about 90% of sequences are equal to or smaller than 1024. In this paper, we propose an improved lightweight BLASTP to speed up the hit detection time for longer query sequences. The largest sequence is enlarged from 512 to 1024. As a result, one more bit is required to encode each sequence position. To meet the requirement, an extended hybrid query-index table (EHQIT) is proposed to accommodate three sequence positions in a four-byte table entry, making only one memory access sufficient to retrieve all the position information as long as the number of hits is equal to or smaller than three. Moreover, if there are more than three hits for a possible word, all the position information will be stored in contiguous table entries, which eliminates branch divergence and reduces memory space for pointers to overflow buffer. A square symmetric scoring matrix, Blosum62, is used to determine the relative score made by matching two characters in a sequence alignment. The experimental results show that for queries shorter than 512 our improved lightweight BLASTP outperforms the original lightweight BLASTP with speedups of 1.2 on average. When the number of hit overflows increases, the speedup can be as high as two. For queries shorter than 1024, our improved lightweight BLASTP can provide speedups ranging from 1.56 to 3.08 over the CUDA-BLAST. In short, the improved lightweight BLASTP can replace the original one because it can support a longer query sequence and provide better performance.

2015 ◽  
Vol 1105 ◽  
pp. 299-304
Author(s):  
A. Al Saleh Mohammad ◽  
A. Yussuf Abdirahman

Polyolefin molecular architectures are designed according to customer needs and demands. Hence, it is essential to determine the catalytic behavior that gives the polymer the characteristics it needs to meet the market requirements. Today most of the industrial polyolefin production depends on multiple-site-type catalysts such as Ziegler-Natta catalysts. In this work a methodology to estimate parameters for polyolefin multiple-site-type catalysts was presented. The sequence length distribution data were simulated using Zeroth-order and First-order Markovian models. These simulated data were used to test the robustness of the optimization method. The optimization method used was able to retrieve and comprehend the proper probabilistic models and provide acceptable polymerization parameters estimates.


2021 ◽  
Author(s):  
David Emms ◽  
Steven Kelly

Determining the evolutionary relationships between gene sequences is fundamental to comparative biological research. However, conducting such analyses requires a high degree of technical proficiency in several computational tools including gene family construction, multiple sequence alignment, and phylogenetic inference. Here we present SHOOT, an easy to use phylogenetic search engine for fast and accurate phylogenetic analysis of biological sequences. SHOOT searches a user-provided query sequence against a database of phylogenetic trees of gene sequences (gene trees) and returns a gene tree with the given query sequence correctly grafted within it. We show that SHOOT can perform this search and placement with comparable speed to a conventional BLAST search. We demonstrate that SHOOT phylogenetic placements are as accurate as conventional multiple sequence alignment and maximum likelihood tree inference approaches. We further show that SHOOT can be used to identify orthologs with equivalent accuracy to conventional orthology inference methods. In summary, SHOOT is an accurate and fast tool for complete phylogenetic analysis of novel query sequences. An easy to use webserver is available online at www.shoot.bio.


1997 ◽  
Vol 70 (2) ◽  
pp. 222-230 ◽  
Author(s):  
Emma Thorn-Csányi ◽  
Hans-Detlef Luginsland

Abstract Intermolecular metathetic polymer degradation opens up an analytic method to identify the quality and quantity of the components in blends of different types of rubber even if they are crosslinked and filled with carbon black, mineral oil, etc.. Furthermore the amount of soluble and insoluble additives can be determined. Moreover, metathetic degradation allows for determination of detailed information about the chemical microstructure (e.g. sequence length distribution of 1,2-butadiene and styrene units) of the rubbers used. This method is suitable for analysis of rubber components in tires.


1994 ◽  
Vol 27 (26) ◽  
pp. 7650-7653 ◽  
Author(s):  
M. F. Barreiro ◽  
R. C. S. Dias ◽  
M. R. N. Costa

Polymer ◽  
1994 ◽  
Vol 35 (17) ◽  
pp. 3698-3702 ◽  
Author(s):  
Hidematsu Suzuki ◽  
Yoshiyuki Nishio ◽  
Noritaka Kimura ◽  
V.B.F. Mathot ◽  
M.F.J. Pijpers ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document