Title: Optimised parallel implementation with dynamic programming technique for the multiple sequence alignment

Authors: T. Gururaj; G.M. Siddesh

Addresses: Department of Information Science and Engineering, Ramaiah Institute of Technology, Bangaluru-560054, India; Affiliated to: Visvesvaraya Technological University, India ' Department of Information Science and Engineering, Ramaiah Institute of Technology, Bangaluru-560054, India; Affiliated to: Visvesvaraya Technological University, India

Abstract: Gene sequencing techniques are very useful in analysing various diseases, especially cancer. The various techniques have been applied for the gene sequence for the effective analysis. These technique help also in reducing the computation time. Most existing methods are of low efficiency in the gene sequence alignment due to lack of proper technique to reduce the gap penalty. In this research, the optimised Needleman-Wunsch (ONW) algorithm is applied for multiple sequence alignment (MSA). The ONW technique uses Needleman-Wunsch (NW) algorithm in parallel implementation for multiple genes. The dynamic programming technique such as the backtracking algorithm is applied for reducing the gap penalty in the gene alignment. The proposed ONW algorithm is applied in the case study and being analysed for its performance. This proves that the proposed ONW algorithm has higher performance compared to the other existing method in the MSA techniques. The proposed method has an average similarity of 88.85%, while the existing method has a similarity of 60.23%.

Keywords: backtracking algorithm; gap penalty; multiple sequence alignment; MSA; optimised Needleman-Wunsch algorithm; parallel implementation.

DOI: 10.1504/IJBDI.2020.109665

International Journal of Big Data Intelligence, 2020 Vol.7 No.3, pp.148 - 156

Received: 20 Dec 2019
Accepted: 25 Jan 2020
Published online: 18 Sep 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article