Suffix arrays and Suffix Binary Search Tree are two data structures that have been proposed as alternatives to classical Suffix Trees to facilitate efficient on-line approximate string searching. The relationship between these two structures is already explained in the paper "Suffix Binary Search Tree and Suffix Arrays" by two authors namely Robert W. Irving and Lorna Love. In their paper they have described an elegant and efficient algorithm to construct the suffix arrays and its auxiliaries from and arbitrary suffix binary search tree. This thesis if focused on implementing the algorithm and exploring the performance (construction time and search time) of the program for certain types of inputs like genome sequence, plain text, code etc.
