Figure 3
Possible relative positions of two maximal pairings connected by an embedding graph edge. The figure presents the possible configurations of relative positions of two maximal pairings e k = (p k , t k , l k ) and v k +1 = (p k +1, t k +1, l k +1) connected by an embedding graph edge (e k , v k +1). Each box represents a common maximal factor on T (top) and P (bottom) of a maximal pairing. Each maximal pairing is represented by two boxes connected by lines (boxes representing e k are in bold). For each case, t k corresponds to the left border of the upper bold box, p k is the left border of the lower bold box, t k +1 is the left border of the upper normal box, and p k +1 is the left border of the lower normal box. Distance |(t k +1 - t k ) - (p k +1 - p k )| has been represented by a double ended arrow, while factor overlaps are highlighted by grey shades. Four possible cases are presented: (a) e k , v k +1 overlap on both T and P, (b) e k , v k +1 overlap on T but not on P , (c) e k , v k +1 overlap on P but not on T, and (d) e k , v k +1 do not overlap neither on T nor on P.