About
My Project: The Linear Time Construction of Suffix Trees with Ukkonen's algorithm.
Project Updates
Weeks 6-7
Implement Testing Infastructure & Done!
Write function for random string generation and test the algorithm to show linearity.The code is runnable here, along with the testing for linear time.
Weeks 4-5
Begining Implementing Ukkonen's algorithm.
Run tests comparing the algorithm to results from the O(n^2) algorithm and the visualalgo implementation of suffix trees.Weeks 2-3
Implement and test O(n^2) algorithm
Week 1
Project Selected 🎉
Contact Me!
Email me at mstro016 [at] ucr [dot] edu.