lcs-0.2: Find longest common sublist of two lists
Data.List.LCS
Description
Provides a function lcs that takes two lists and returns a longest common sublist. For example, lcs abcd acbd is either abd or acd.
Synopsis
lcs :: Ord a => [a] -> [a] -> [a]Source
The lcs function takes two lists and returns a list with a longest common subsequence of the two.
lcs