Finding LCS

October 16, 2012 at 4:00 PMalex

Turned out to be a very useful find in case where a LCS needs to be found for very large collections. The following algorithm can be implemented using MapReduce giving a very good Nlogn asymptotic performance:

A New Efficient Algorithm for Computing the Longest Common Subsequence

Posted in:


Comments are closed