在C#中寻找后缀树实现? [英] Looking for the suffix tree implementation in C#?

查看:190
本文介绍了在C#中寻找后缀树实现?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我已经对一个研究项目进行了基本的搜索。我想通过建立后缀树来提高搜索效率。我对C#实施 Ukkonen 算法感兴趣。如果这样的实现存在,我不想浪费自己的时间。

解决方案

硬盘问题。这是最接近的比赛,我可以找到: 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/

这篇关于在C#中寻找后缀树实现?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆