The primary focus was on developing and comparing basic Dynamic Programming solutions and memory-efficient versions to find the optimal alignment between two strings. The project considered two ...

The tracker.java is used for marking purpose to track divide-and-conquer calls. Do not modify any code associated ... This method computes the minimal total cost of a sequence of character edits ...

Abstract: On shared-memory multicore machines, classic two-way recursive divide-and-conquer algorithms are implemented using common fork-join based parallel programming paradigms such as Intel Cilk+ ...