This project is about implementing and experimenting with pairwise sequence comparison methods to compute optimal global alignments of two sequences where the object is to minimize a cost.
Experiment on whether the way we find the number of optimal alignments is more efficient than the way described in class.
Proposed method: We might have to play around with the score matrices to produce different number of optimal alignments
Experiment on whether the way we find the number of optimal alignments is more efficient than the way described in class. Proposed method: We might have to play around with the score matrices to produce different number of optimal alignments