Ukkonen's Algorithm is a Linear-Time (O(n)) Online Algorithm for Constructing Suffix Trees by Incrementally Building Implicit Suffix Trees for Each Prefix of the Input String, Using Suffix Links to Achieve Efficient and Notable Linear-Time Performance