Are There Any Good C++ Suffix Trie Libraries? [closed]

As it currently stands, this question is not a good f开发者_开发问答it for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance. Closed 11 years ago.

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.

---

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.

---

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.

---

Most likely this is a tutorial but IMO worth reading and with source code: http://marknelson.us/1996/08/01/suffix-trees.