Optimised parallel implementation with dynamic programming technique for the multiple sequence alignment. (10th September 2020)

• Record Type: Journal Article
• Authors: Gururaj, T.; Siddesh, G.M.
• Is Part Of: International journal of big data intelligence. Volume 7:Number 3(2021)
• Page Start: 148
• Page End: 156
• Publication Date: 2020-09-10
• Subjects: backtracking algorithm -- gap penalty -- multiple sequence alignment -- MSA -- optimised Needleman-Wunsch algorithm -- parallel implementation; Big data -- Periodicals; 005.705
• Languages: English
• ISSNs: 2053-1389

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%.