Longest Common Substring Java Implementation Using Ukkonen's Algorithm
I ultimately designed my own classes for this problem. However, for building the tree itself, I referenced these following pages for the logic:
k-phan/UkkonenLCS
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|