Our algorithm, HATS, uses a tree to maintain potential candidate sequential patterns in each sequence parallelly.

• 我们的演算法简称为HATS，运用树状结构代表每一个序列中的循序元素。