我应该读什么来理解后缀树？
我逐渐了解到后缀树对于许多字符串相关任务来说是优秀且有用的结构，我想了解更多关于它们的信息。谁能建议一个理解这些事情的良好起点？也就是说，我不需要一些现成的代码或库来实现它，但也许需要一些教程来展示它们是如何构建的，以及你可以用它们做什么。我喜欢“娱乐编程”，后缀树在我的学习清单中名列前茅:)
PS：我更喜欢 Delphi/pascal，但欢迎任何语言的教程。
I've come to understand that suffix trees are excellent and useful structures for a multitude of string related tasks, and I would like to learn more about them. Can anyone suggest a good starting point for UNDERSTANDING these things? That is, I don't need some ready made code or library that implements it, but maybe some tutorials that show how they are built, and what you can do with them. I enjoy "recreational programming", and suffix trees are high on my list of things to learn :)
PS: I prefer Delphi/pascal, but tutorials in any language are welcome.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
维基百科是一个很好的起点。后缀树文章有大量参考资料和外部链接。 NIST 页面 很简单。还有来自 Dr. Dobb's Journal 的一篇文章。一般来说，我推荐Cormen / Leiserson / Rivest / Stein算法书< /a>，但我手边没有副本，因此无法确认它们实际上涵盖了后缀树。
Wikipedia is a great place to start. The Suffix Tree article has plenty of references and external links. The NIST page is kind of light. There is also an article from Dr. Dobb's Journal. In general, I'd recommend the Cormen / Leiserson / Rivest / Stein Algorithms book, but I don't have a copy handy so can't confirm that they actually cover Suffix Trees.