This lecture introduces an elegant variant of the sequence alignment algorithm that we discussed in the previous lecture. The original algorithm runs in quadratic time and needs quadratic space. The variant runs as well in quadratic time, however, it only needs linear space which makes it more feasible for applications in bioinformatics. The linear space algorithm is designed in a clever combination of divide-and-conquer and dynamic programming approaches. The instruction language is Arabic, however, all material, slides, definitions, concepts, examples, etc., are all given in English.
