论文标题
弦覆盖：调查
String Covering: A Survey
论文作者
论文摘要
字符串的研究是数字计算机之前的重要组合领域。字符串可能很长，数万亿个字母，因此找到紧凑的表示非常重要。在这里，我们首先调查了一种潜在的压实方法的各种形式，即给定的字符串X的封面，最初是在1990年以简单形式提出的，但由于发现了更复杂的变体，因此越来越有趣。然后，我们考虑用种子覆盖。也就是说，X的超声词的封面。我们最终提出了许多有关研究方向的建议，这些建议将来可以为弦处理做出重大贡献。
The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one potential compaction methodology, the cover of a given string x, initially proposed in a simple form in 1990, but increasingly of interest as more sophisticated variants have been discovered. We then consider covering by a seed; that is, a cover of a superstring of x. We conclude with many proposals for research directions that could make significant contributions to string processing in future.
