Pairwise Sequence Alignment between HBV and HCC Using Modified Needleman Wunsch Algorithm

The complexity of DNA sequence using dynamic programming, Needleman-Wunsch algorithm, is very high. [...]it is purpose to modifiy the method of Needleman Wunsch algorithm for optimum global DNA sequence alignment. The previous research had limitation in scalability,which difference of sequence length cannot more than of 10 [11]. [...]we develop this prevous reseach by modifying Needleman-Wunsch method as a dynamic programming approarch in single memory for pairwise sequence alignment in order to get the similarity rate between HBV and HCC. First scenario is finding characteristics for DNA sequences of HBV and HCC based on similarity using either modified or original Needeman Wunsch. [...]it is achieved using the modified method's performance including average similarity rate=96.549% and score=849.8 with computational time=1370 ms. How ever, the performance is achieved using original Needleman Wunsch, i.e. similarity rate= 96.548% and score = 849.8 with total computational time=64131ms. [...]the accuracy rate of the both method is 99.854% and there is time reduction as 78.95%.