next up previous
Next: Split and shifted gaps Up: Classification of the problems Previous: Shifted gaps

Split gaps

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.



Event 1    1'        Event     1
A: RPC__VCP_VLRQ     A: RPCVCP___VLRQ
B: KPCVCPRQLVLRQ  => C: KPCVCPRQLVLRQ
B: KPCVCPRQLVLRQ     D: KPCVCPRQLVLRQ
D: KPCLCPKQAAVKQ     E: KPCLCPKQAAVKQ



\psfig{file=gaps/splitgaps.EPS,height=0.11\textheight,angle=0}




Chantal Korostensky
1999-07-14