如何在多个二进制文件中找到最长的公共子序列？

Question

I am given 10 binary files and I have to find the longest strand of bytes that is identical between two or more files. Any help is appreciated. Thanks in advance.

Answer 1

• A brute force approach would be to compare each file to any other file, which would require 10 * 9 = 90 comparisons.

• And for comparing any two files, you could just run through them bytewise and compare if they are equal, and then along the way you store the longest sequence found so far. Any time a sequence breaks, you start a new temporary sequence and only store it when it is longer than the original.

• Another but somewhat similar approach is to use dynamic programming for the longest common subsequence (LCS) but requires more memory than the previous so depends on the size of the files and etc., but for this approach, there are plenty of resources with graphic visualizations and pseudo-code of the algorithm.