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  . 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.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com