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.
Make a program global_affine_linspace that is similar to global_affine but consumes only linear space. You need to extend Hirscberg's idea to handle affine gap cost. (Explain in the report how you extend the idea, and verify carefully that your program computes an optimal alignment.)
Make a program
global_affine_linspacethat is similar to global_affine but consumes only linear space. You need to extend Hirscberg's idea to handle affine gap cost. (Explain in the report how you extend the idea, and verify carefully that your program computes an optimal alignment.)