The SDSL (Succinct Data Structure Library) has various implementations of string indices based on suffix arrays. It is currently using third-party algorithms for suffix array construction. This thesis aims at designing an interface for choosing between different construction algorithms and implementing two differnet algorithms.
Both algorithms will have to be tested and evaluated (also against the third-party construction algorithm of the SDSL)
For questions, please contact christopher.pockrandt@fu-berlin.de (Takustr. 9, Room 010). This topic can also be handed out for a Bachelor thesis (implementing only one algorithm)