Implementations of Suffix Trees Algorithms
-
Updated
Apr 23, 2017 - C
Implementations of Suffix Trees Algorithms
1st year master project: Create a suffix tree to find the longest substring common to N texts
Implementation of Farach Suffix Tree algorithm
Suffix tree construction: Naive Algorithm and (currently working on) Ukkonen's.
Add a description, image, and links to the suffix-tree topic page so that developers can more easily learn about it.
To associate your repository with the suffix-tree topic, visit your repo's landing page and select "manage topics."