Often we need not just the edit distance but also the alignment of the two string sequences and possibly the sequence to edits needed to go from one string sequence to the other. This is called a backtrace as we start from the bottom right cell of the alignment matrix and sequentially trace back to the beginning of the two strings and record the edits along the path. We have written a serial implementation of the backtrace in our GitHub repo. An interesting extension to explore further would be to develop a potential parallel implementation of the backtrace algorithm.