Reference to "Algorithms on Strings, Trees, and Sequences" by Dan Gusfield.
The string of lenght m can be generated into m sufflix can be stored
created this structure requieres time O(m)
- for a parttner requieres tiimeO(n)
These two properties make the suffix tree an appealing structure for a diverse range of bioinformatics applications including: multiple genome alignment (Michael Hohl et al., 2002)