<s>
in	O
the	O
multiple	O
sequence	B-Algorithm
alignment	I-Algorithm
of	O
genomes	O
in	O
computational	O
biology	O
.	O
</s>
<s>
Identification	O
of	O
MUMs	O
and	O
other	O
potential	O
anchors	O
,	O
is	O
the	O
first	O
step	O
in	O
larger	O
alignment	O
systems	O
such	O
as	O
MUMmer	B-Application
.	O
</s>
<s>
There	O
are	O
several	O
algorithmic	O
ways	O
to	O
approach	O
identifying	O
MUMs	O
in	O
multiple	O
sequence	B-Algorithm
alignment	I-Algorithm
.	O
</s>
<s>
The	O
simplest	O
and	O
slowest	O
method	O
is	O
using	O
brute	O
force	O
where	O
for	O
every	O
index	O
in	O
genome	O
and	O
every	O
index	O
in	O
genome	O
,	O
you	O
calculate	O
the	O
longest	B-Data_Structure
common	I-Data_Structure
prefix	I-Data_Structure
of	O
and	O
.	O
</s>
<s>
In	O
actuality	O
though	O
MUMs	O
are	O
identified	O
by	O
building	O
a	O
generalized	B-Algorithm
suffix	I-Algorithm
tree	I-Algorithm
for	O
and	O
.	O
</s>
<s>
MEMs	O
are	O
like	O
local	B-Algorithm
alignment	I-Algorithm
but	O
in	O
this	O
case	O
only	O
identify	O
sequences	O
where	O
there	O
are	O
no	O
gaps	O
.	O
</s>
