2016-05-19 12:53:05 +02:00
|
|
|
libstree is a generic suffix tree implementation, written in C.
|
|
|
|
|
It can handle arbitrary data structures as elements of a string.
|
|
|
|
|
Unlike most demo implementations, it is not limited to simple ASCII
|
|
|
|
|
character strings. Suffix tree generation in libstree is highly
|
|
|
|
|
efficient and implemented using the algorithm by Ukkonen, which
|
|
|
|
|
means that libstree builds suffix trees in time linear to the length
|
|
|
|
|
of the strings (assuming that string element comparisons can be done
|
2006-03-15 11:40:38 +01:00
|
|
|
in O(1)).
|
|
|
|
|
|
2016-05-23 20:36:52 +02:00
|
|
|
WWW: http://www.icir.org/christian/libstree/
|
