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_linear_linspace that is similar to global_linear but consumes only linear space, i.e. use Hirscberg's idea for finding an optimal global alignment in linear space.
Make a program
global_linear_linspacethat is similar to global_linear but consumes only linear space, i.e. use Hirscberg's idea for finding an optimal global alignment in linear space.