LongestCommonSequence finds a longest common subsequence between 2 lists. Apparently, this built-in function does not accept more than 2 arguments. How can I find a longest common subsequence between 3 or more lists using Mathematica? Or, better yet, all longest common subsequences?
In a response to a "close as a duplicate" vote: This is not a duplicate of Longest common substring for multiple strings? beacuse that question is concerned with substrings (contiguous subsequences), but my question is concerned with arbitrary (not necessarily contiguous) subsequences.