!!!!!!!!!! Note: this is totally uncomplete - Work in progress ! !!!!!!!!!!

This is an implementation of a Ukkonen tree in Fantom.

Implemented and tested according to this "spec" :

A Ukkonen tree behaves like a suffix tree(trie) however it has several enhancements : 1) Construction is O(n) or O(nLogn) whereas a regular suffix tree can be O(n2) or even O(n3) 2) Greatly minimized memory use.

It is good for Indexing / Searching text and also good to find "near matches" / string patterns and such.

See much more detailed info aout the algorithm here: