Often algorithms produce several gaps close
together in one sequence. In reality such gaps often belong to
just one indel event. When two such gaps gi and gj are
depicted in a tree, they appear on the same edge in the tree. When
the gaps are combined only one event is left (see figure
).
Figure:
When close gaps are grouped
together, this corresponds to "fusing" the event in the
evolutionary tree.