Manuscript Number : CSEIT1726243
Improvisation of Global Pairwise Sequence Alignment Algorithm Using Dynamic Programming
Authors(3) :-Jyoti Lakhani, Ajay Khunteta, Dharmesh Harwani The global pairwise sequence alignment algorithms based on dynamic programming match each base pair step by step in the sequence under observation from start to end. This approach increases the time complexity which increases further many folds when large sequences are used. Needleman-Wunsch, Smith-Waterman, ALIGN, FASTA, BLAST and many other pair-wise sequence alignment algorithms are based on dynamic programming approach. The present communication is an attempt to provide a method for improvisation in dynamic programming used for pair-wise sequence alignment. The proposed technique is based on look-ahead method which decides whether it is required to continue or stop the processing of alignment steps for the sequence pair under observation from the current point if significant match score is not achieved. A threshold to be set by a user a-priori, indicating minimum percent match per base error to be accepted in sequence alignment process. The present improvisation method of dynamic programming can reduce bulky computational steps and hence save a reasonable amount of time in pairwise sequence alignment process.
Jyoti Lakhani Improvisation, Pairwise Sequence Alignment, Dynamic Programming, Time Complexity Publication Details Published in : Volume 2 | Issue 6 | November-December 2017 Article Preview
Poornima University, Jaipur & Maharaja Ganga Singh University, Bikaner, Rajasthan, India
Ajay Khunteta
Poornima University, Jaipur, Rajasthan, India
Dharmesh Harwani
Maharaja Ganga Singh University, Bikaner, Rajasthan, India
Date of Publication : 2017-12-31
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 909-914
Manuscript Number : CSEIT1726243
Publisher : Technoscience Academy