Does anyone know of a really rock solid C++ library for suffix tries? Other than the one in Mummer?
Ideally, I'd like:
Some concept of concurrency.
Good caching behavior.
Permissive license.
Support for arbitrary alphabets.
有没有人知道一个真正坚如磐石的C ++库用于后缀尝试?除了哑剧者之外?理想情况下,我想:一些并发概念。良好的缓存行为。许可证。支持任意字母表。
3 个解决方案
#1
8
Being a bioinformatician, my pick would be SeqAn (check out the sequence index section). It implements a lazy suffix tree and an enhanced suffix array (an equivalent data structure), both of which have good cache behaviour.
作为生物信息学家,我的选择是SeqAn(查看序列索引部分)。它实现了一个惰性后缀树和一个增强的后缀数组(一个等效的数据结构),两者都具有良好的缓存行为。
#2
2
Having actually used and then forgotten PATL, I'd like to tuck in a link in an answer.
http://code.google.com/p/patl/
It's got a couple really distinct features, and is generally pleasant reading as well.
实际上已经使用然后忘记了PATL,我想在一个答案中找到一个链接。 http://code.google.com/p/patl/它有一些非常独特的功能,通常也是愉快的阅读。
#3
1
Most likely this is a tutorial but IMO worth reading and with source code: http://marknelson.us/1996/08/01/suffix-trees.
很可能这是一个教程,但IMO值得一读,并附有源代码:http://marknelson.us/1996/08/01/suffix-trees。
#1
8
Being a bioinformatician, my pick would be SeqAn (check out the sequence index section). It implements a lazy suffix tree and an enhanced suffix array (an equivalent data structure), both of which have good cache behaviour.
作为生物信息学家,我的选择是SeqAn(查看序列索引部分)。它实现了一个惰性后缀树和一个增强的后缀数组(一个等效的数据结构),两者都具有良好的缓存行为。
#2
2
Having actually used and then forgotten PATL, I'd like to tuck in a link in an answer.
http://code.google.com/p/patl/
It's got a couple really distinct features, and is generally pleasant reading as well.
实际上已经使用然后忘记了PATL,我想在一个答案中找到一个链接。 http://code.google.com/p/patl/它有一些非常独特的功能,通常也是愉快的阅读。
#3
1
Most likely this is a tutorial but IMO worth reading and with source code: http://marknelson.us/1996/08/01/suffix-trees.
很可能这是一个教程,但IMO值得一读,并附有源代码:http://marknelson.us/1996/08/01/suffix-trees。