Writing a program for creating suffix array using Skew algorithm based on these(1, 2) articles.

Reading papers on memory usage optimization for suffix arrays

1. Space Efficient Linear-Time Construction of Suffix Arrays

2. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays

Changed project from Baum-Welch. Implement the Baum-Welch algorithm for HMM described in class. Test the training of the HMM on a biological relevant dataset (e.g. TF binding sites), and test in on a chrosomome. Collect experimental time measurements. to suffix arrays implementation