We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm, therefore its performance improves if the string is not self similar. This occurs naturally on strings over large alphabets. Our algorithm relies on new results for data structures that support dynamic longest increasing sub-sequences. In the process we also obtain improved algorithms for the decremental string comparison problem.

中文翻译：

---

最小的最长串联分散子序列

我们考虑识别串内串联分散子序列的问题。我们的算法识别出一个最长的子序列，它在一个字符串中出现两次而没有重叠。该算法基于 Hunt-Szymanski 算法，因此如果字符串不是自相似的，则其性能会提高。这自然发生在大字母表上的字符串上。我们的算法依赖于支持动态最长递增子序列的数据结构的新结果。在此过程中，我们还获得了递减字符串比较问题的改进算法。