Hi everyone! Today I was looking for a way to solve de LCS (Longest Common Subsequence) problem for n strings and I found a curious comment of a member saying that this problem can be reduced to a Vertex Cover. Could someone please help me explaining how to do it?