算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
Scan——对元素序列上执行扫描(包含前缀的求和)。
Scan - "Peforms a scan (inclusive prefix sum) on a sequence of elements."
结果应该是一个字典，从前缀到一个可能的后缀组成的序列的映射。
The result should be a dictionary that maps from prefixes to a collection of possible suffixes.
应用推荐