Implement suffix tree and suffix array construction algorithms #51
Description
Example publications for suffix tree:
- Breslauer, Italiano - Near real-time suffix tree construction via the fringe marked ancestor problem
- Giegerich, Kurtz, Stoye - Efficient implementation of lazy suffix trees
- Andersson, Nilsson - Efficient Implementation of Suffix Trees
Example publications for suffix array:
- Sadakane - A Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation,
- Nong - Practical Linear-Time O(1)-Workspace Suffix Sorting for Constant Alphabets,
- Kim, Sim, Park, Park - Linear-time construction of suffix arrays,
- Rajasekaran, Nicolae - An elegant algorithm for the construction of suffix arrays,
- Abouelhoda, Kurtz, Ohlebusch - Replacing suffix trees with enhanced suffix arrays,
- Manzini, Ferragina - Engineering a Lightweight Suffix Array Construction Algorithm,
- Itoh, Tanaka - An efficient method for in memory construction of suffix arrays.