Global Alignment in linear space

The backtracing algorithm requires the entire matrix to be saved in memory. The space complexity consequently increases to O(nm). Hirschberg [4] developed a more practical space-reduction method for solving dynamic programming problems that reduces the required space from O(nm) to O(m) (for m<n).  
21#21

 22#22

23#23