什么是最appoach（服务表现明智）在解决这个问题呢？

What would be that best appoach (performace-wise) in solving this problem?

有人建议使用后缀树，这是最好的方法？如果是的话，什么样的后缀树的？

It was suggested to use suffix trees, it that the best approach? and if so, what kind of suffix tree?

感谢您

推荐答案

看一看的http：// en.wikipedia.org/wiki/Suffix_array 的，以及 - 它们都相当空间效益，并有一些合理的可编程的算法以产生它们，例如简单线性工作后缀数组施工由Karkkainen和桑德斯

Have a look at http://en.wikipedia.org/wiki/Suffix_array as well - they are quite space-efficient and have some reasonably programmable algorithms to produce them, such as "Simple Linear Work Suffix Array Construction" by Karkkainen and Sanders