The comparison of genomes is based on substrings, called MUMs, that appear only once in each genome and are maximal. The set of MUMs determines the skeleton from which a global comparison can be established. The search of MUMs is handled with Suffix trees which are those trees that store all suffixes of a given sequence. The searching algorithm builds a generalized suffixtree for each pair and finds the MUMs between them.