Longest Increasing Subsequence

27 novembro 2014, 11:00 • Luís Manuel Silveira Russo

An O(n log n) algorithm for the LIS problem. Adapting shift-and for the edit distance.