study / algorithm

An implementation of generalized suffix tree using Ukkonen’s algorithm. In this page: The longest common substring problem How it works GST versus Dynamic programming Inspired by: Ukkonen, E. On-line construction of suffix trees. Algorithmica 14, 249–260 (1995). https://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf The longest common substring problem Given two or more strings, find the longest common substring of these strings. Concretely, the longest common substring of the two strings “cacaocac” and “ccaooc” is “cao”....