Figure 5From: Readjoiner: a fast and memory efficient string graph-based sequence assemblerTransitivity and left contexts. Transitivity and left contexts. Let the SPM 〈t, r, |z|〉 be derived from 〈s, r, |zz’|〉. Hence the left context LC(s, |zz’|) = xy is a suffix of the left context LC(t, |z|) = wxy. Let 〈u, r, |z|〉 be an irreducible SPM. Then LC(u, |yz|) = vy for some non empty string v and LC(s, |zz’|) is not a suffix of vy.Back to article page