硬盘问题。这是最接近的比赛，我可以找到： http://www.codeproject.com/KB /recipes/ahocorasick.aspx ，它是Aho-Corasick字符串匹配算法的实现。现在，该算法使用了后缀树状结构： http：//en.wikipedia。 org / wiki / Aho-Corasick_algorithm

现在，如果你想要一个前缀树，这篇文章声称给你一个实现： http://www.codeproject.com/KB/recipes/prefixtree.aspx

< HUMOR >现在我做了你的功课，你如何修剪我的草坪。 （参考： http://flyingmoose.org/tolksarc/homework.htm ）< / HUMOR >

编辑：我发现一个C＃后缀树实现是一个发布在C ++的端口一个博客： http://code.google.com/ p / csharsuffixtree / source / browse /＃svn / trunk / suffixtree

编辑：Codeplex有一个新项目专注于后缀树： http://suffixtree.codeplex.com/

I've implemented a basic search for a research project. I'm trying to make the search more efficient by building a suffix tree. I'm interested in a C# implementation of the Ukkonen algorith. I don't want to waste time rolling my own if such implementation exists.

Hard question. Here's the closest to match I could find: http://www.codeproject.com/KB/recipes/ahocorasick.aspx, which is an implementation of the Aho-Corasick string matching algorithm. Now, the algorithm uses a suffix-tree-like structure per: http://en.wikipedia.org/wiki/Aho-Corasick_algorithm

Now, if you want a prefix tree, this article claims to have an implementation for you: http://www.codeproject.com/KB/recipes/prefixtree.aspx

<HUMOR> Now that I did your homework, how about you mow my lawn. (Reference: http://flyingmoose.org/tolksarc/homework.htm) </HUMOR>

Edit: I found a C# suffix tree implementation that was a port of a C++ one posted on a blog: http://code.google.com/p/csharsuffixtree/source/browse/#svn/trunk/suffixtree

Edit: There is a new project at Codeplex that is focused on suffix trees: http://suffixtree.codeplex.com/