Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:
Dear monks,
I saw a Perl implementation on this forum to determine the longest common subsequence among M strings. Let assume there are three strings S1, S2, and S3. Would the common subsequence be found by determining the common subsequence between S1 and S2 (let's call it R12), then take this result and find the common subsequence between it (R12) and S3. Will this work or under what condition will this method fail? Any thought?
I saw a Perl implementation on this forum to determine the longest common subsequence among M strings. Let assume there are three strings S1, S2, and S3. Would the common subsequence be found by determining the common subsequence between S1 and S2 (let's call it R12), then take this result and find the common subsequence between it (R12) and S3. Will this work or under what condition will this method fail? Any thought?
Back to
Seekers of Perl Wisdom