- findMostProgress
Takes the array with furthest reaching D-paths from an LCS computation and
returns the x,y coordinat
- find_middle_snake
Helper function for Myers' LCS algorithm to find the middle snake for
l1[bottoml1..topl1] and l2[bot
- getLength1
- getLength2
- isRangeEqual
- lcs_rec
The recursive helper function for Myers' LCS. Computes the LCS of l1[bottoml1 ..
topl1] and l2[botto
- setLcs
- worked
- longestCommonSubsequence
Myers' algorithm for longest common subsequence. O((M + N)D) worst case time,
O(M + N + D^2) expecte