After computing the longest common subsequence, minimize the pair (number of common parts, number of unique parts) to return the best possible partition of the initial sequences.
In image, the difference with the patch:
This is still a bit slow, I may be missing something.
After computing the longest common subsequence, minimize the pair (number of common parts, number of unique parts) to return the best possible partition of the initial sequences.
In image, the difference with the patch:
This is still a bit slow, I may be missing something.
27
Link to cs.stackoverflow question: https://cs.stackexchange.com/questions/117605/find-the-best-longest-common-subsequence