I plan to work on the Suffix Tree project.



Feb 23: Last week, I talked to professor Lonardi about my project and asked some of my questions.



- I have studied the Ukkonen's algorithm for building a suffix tree and traced it by hand for some string examples.

- This week, I plan to design my algorithm, so that I can start the implementation as soon as possible.



March 9: I finished the implementation of the suffix tree. it works correctly when I compare its results with the suffix trees that I draw by hand.

 

- I am going to test it for very large inputs.

- I should add the maximal unique match finder function to my project



March 15: I added the function that finds the maximal unique match and tested my code. It works correctly...