Does the General Longest Common Subsequence problem reduce to its binary version?

Is any polynomial (reasonably efficient) reduction which makes possible solving the LCS problem for inputs over any arbitrary alphabet through solving LCS for bit-strings? Even though the...

04 April 2019 8,895 2 View