Maximum Longest Common Subsequence
Hi guys!
I know how to calculate the Longest Common Subsequence, but I don't know how to find the lexicographic maximum of longest common subsequences.
How can I find it after I dynamically generate the matrix?
Thanks in advice!
I know how to calculate the Longest Common Subsequence, but I don't know how to find the lexicographic maximum of longest common subsequences.
How can I find it after I dynamically generate the matrix?
Thanks in advice!
Topic archived. No new replies allowed.