Suffix tree package
A suffix tree is a data type that can be used for several things. Its main use is to efficiently search substrings in larger strings. This can be done in linear time.
However, the algorithm that builds a suffix tree is not straightforward. It took me some time to get it to work, so I would like to share it with you. It is written in C++. There used to be two versions available, one with template classes and one without. However, the current implementation only uses templates.
If you have any questions or would like to see some additional information, please let me know.
Please note that when you download it, you will need to register with me (so I can keep track of who uses it). Your email address will NOT be used for anything else. If you want to know about future releases of my software, you can indicate this, but the default is not to let you know.
Register the software with me at: <firstname.lastname@example.org>. It is free and your email address will not be misused!!! (I'm just curious who is using it and why.)