Random Benchmark Set

该数据集由随机生成的字符串实例组成，这些实例具有不同参数的各种组合。具体来说，实例是为以下参数组合生成的：n取值范围为{200, 500, 1000}，m取值范围为{3, 5, 10}，p取值范围为{3, 5, 10}，同时长度和字母表大小也有所变化。该数据集规模包含810个随机受限最长公共子序列问题实例。其任务是评估针对受限最长公共子序列问题的启发式算法。

This dataset comprises randomly generated string instances with diverse combinations of parameters. Specifically, the instances are generated for the following parameter sets: n takes values from {200, 500, 1000}, m from {3, 5, 10}, and p from {3, 5, 10}. Additionally, the string lengths and alphabet sizes also vary across instances. The dataset contains a total of 810 constrained Longest Common Subsequence (LCS) problem instances. Its purpose is to evaluate heuristic algorithms designed for the constrained Longest Common Subsequence problem.