Search
Now showing items 1-1 of 1
Reducing the search space and time complexity of needleman-wunsch algorithm (global alignment) and smith waterman algorithm (local alignment) for DNA sequence alignment
(Universiti Malaysia Perlis (UniMAP), 2011)
The fundamental procedure of analyzing sequence content is sequence comparison.
Sequence comparison can be defined as the problem of finding which parts of the
sequences are similar and which parts are different, namely ...