Optimised parallel implementation with dynamic programming technique for the multiple sequence alignment Online publication date: Fri, 18-Sep-2020
by T. Gururaj; G.M. Siddesh
International Journal of Big Data Intelligence (IJBDI), Vol. 7, No. 3, 2020
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%.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Big Data Intelligence (IJBDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook