scholarly journals Parallel algorithms for large-scale biological sequence alignment on Xeon-Phi based clusters

2016 ◽  
Vol 17 (S9) ◽  
Author(s):  
Haidong Lan ◽  
Yuandong Chan ◽  
Kai Xu ◽  
Bertil Schmidt ◽  
Shaoliang Peng ◽  
...  
2018 ◽  
Vol 35 (13) ◽  
pp. 2306-2308 ◽  
Author(s):  
Jikai Zhang ◽  
Haidong Lan ◽  
Yuandong Chan ◽  
Yuan Shang ◽  
Bertil Schmidt ◽  
...  

Abstract Motivation Modern bioinformatics tools for analyzing large-scale NGS datasets often need to include fast implementations of core sequence alignment algorithms in order to achieve reasonable execution times. We address this need by presenting the BGSA toolkit for optimized implementations of popular bit-parallel global pairwise alignment algorithms on modern microprocessors. Results BGSA outperforms Edlib, SeqAn and BitPAl for pairwise edit distance computations and Parasail, SeqAn and BitPAl when using more general scoring schemes for pairwise alignments of a batch of sequence reads on both standard multi-core CPUs and Xeon Phi many-core CPUs. Furthermore, banded edit distance performance of BGSA on a Xeon Phi-7210 outperforms the highly optimized NVBio implementation on a Titan X GPU for the seed verification stage of a read mapper by a factor of 4.4. Availability and implementation BGSA is open-source and available at https://github.com/sdu-hpcl/BGSA. Supplementary information Supplementary data are available at Bioinformatics online.


2016 ◽  
Vol 26 (04) ◽  
pp. 1750066 ◽  
Author(s):  
Lamiche Chaabane ◽  
Moussaoui Abdelouahab

One of the most essential operations in biological sequence analysis is multiple sequence alignment (MSA), where it is used for constructing evolutionary trees for DNA sequences and for analyzing the protein structures to help design new proteins. In this research study, a new method for solving sequence alignment problem is proposed, which is named improved tabu search (ITS). This algorithm is based on the classical tabu search (TS) optimizing technique. ITS is implemented in order to obtain results of multiple sequence alignment. Several variants concerning neighborhood generation and intensification/diversification strategies for our proposed ITS are investigated. Simulation results on a large scale of datasets have shown the efficacy of the developed approach and its capacity to achieve good quality solutions in terms of scores comparing to those given by other existing methods.


Sign in / Sign up

Export Citation Format

Share Document