Ukkonen's suffix tree algorithm explained in plain English

For those who want to learn more about this kind of algorithms on strings, there is a great book named, unsurprisingly, "Algorithms on Strings" (<a href="http://www.amazon.com/Algorithms-Strings-Maxime-Crochemore/dp/0521848997" rel="nofollow">http://www.amazon.com/Algorithms-Strings-Maxime-Crochemore/d...</a>).<p>Although I must admint, jogojapan has written a really clear and thoughtful explanation of Ukkonen's algorithm on stackoverflow, the best one I've ever read.

For anyone (like me) that isn't familiar with what this would be used for should have a look at the first link the Stack Overflow OP references: <a href="http://marknelson.us/1996/08/01/suffix-trees/" rel="nofollow">http://marknelson.us/1996/08/01/suffix-trees/</a>