En el present article es presenta una implementació d'un Suffix Trie optimitzat. Nosaltres explicarem el seu disseny i presentarem un algorisme per Motif Discovery.

Motif discovery is a challenging problem from a computational point of view [5] [6]. Binding sites are better conserved in DNA because they have a biological function and are therefore under selective pressure. Motif discovery algorithms can help us detect them.To tackle our problem we design and implement an index structure and a motif discovery algorithm. In this thesis we will investigate memory and performance optimizations.