summaryrefslogtreecommitdiff
path: root/textproc/libstree/pkg-descr
diff options
context:
space:
mode:
Diffstat (limited to 'textproc/libstree/pkg-descr')
-rw-r--r--textproc/libstree/pkg-descr10
1 files changed, 10 insertions, 0 deletions
diff --git a/textproc/libstree/pkg-descr b/textproc/libstree/pkg-descr
new file mode 100644
index 000000000000..efaabe86bf8a
--- /dev/null
+++ b/textproc/libstree/pkg-descr
@@ -0,0 +1,10 @@
+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
+in O(1)).
+
+WWW: http://www.cl.cam.ac.uk/~cpk25/libstree/