Ukkonen algorithm in C++

Question

Is there an implementation of the Ukkonen's algorithm for building Suffix Tree in C++? Any implementation in a high level language is good too.

I want to try the problems listed at http://allisons.org/ll/AlgDS/Tree/Suffix/ — shreyasva, Oct 18 '11 at 03:24
I think more work has been done using suffix arrays rather than suffix trees since their memory footprints are smaller. You can probably find an easier construction algorithm using those. — GWW, Oct 18 '11 at 03:44

score 1 · Answer 1 · answered Oct 18 '11 at 20:18

Here's Mark Nelsons article with source code attached at the end:

http://marknelson.us/1996/08/01/suffix-trees/

From the article - "Both my sample code and the descriptions that follow are based on Ukkonen's work, published in the September 1995 issue of Algorithmica."

score 0 · Answer 2 · answered Nov 07 '11 at 20:18

0

There is somewhat modified Ukkonen's algorithm in my PATL library

answered Nov 07 '11 at 20:18

uxn

1
3

Ukkonen algorithm in C++

2 Answers2