A Java implementation of a Generalized Suffix Tree using Ukkonen's algorithm
-
Updated
Nov 2, 2020 - Java
A Java implementation of a Generalized Suffix Tree using Ukkonen's algorithm
Program Structure and Algorithms
Implementing Autocomplete using Tries
A bigram hidden markov model part-of-speech tagger with Viterbi decoding
Various algorithms and data structures for educational purposes
Estudo sobre Tries, suffix arrays e suffix trees em Java
The code done for the completion of coursera course, Algorithms on Strings. --> Code completed in python only.
Suffix tree implemented in java. Focus is on finding the context structure of a string not on efficiency.
Add a description, image, and links to the suffix-tree topic page so that developers can more easily learn about it.
To associate your repository with the suffix-tree topic, visit your repo's landing page and select "manage topics."