Note: This topic is already reserved. However, if you are interested, something similar can be defined.

Sorting all suffixes of a text in lexicographic order is a widely studied fundamental problem in combinatorial pattern matching. Also several algorithms for distributed suffix sorting exist under different communication models. The topic of the thesis would be to survey distributed suffix sorting literature and select suitable algorithm(s) for implementation & experimentation using e.g. the MapReduce distributed computation framework.