The Suffix Tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, which renders them useless for large problems. In this project I implemented a new version based on a recent theoretical proposal and show it yields an extremely interesting structure.