I'm writing a paper that frequently references regions on a string, and these regions often intersect. I need to succinctly describe regions that almost completely intersect.
For example, given the string ACGT, suppose I have two regions described by [start,end] coordinates as follows:
R1=[0,2]="ACG"
R2=[1,3]="CGT"
Such that if these regions were laid side-by-side, we'd see that they intersect over the characters "CG":
ACG-
-CGT
This particular situation arises a lot. I get two regions of equal length that intersect completely minus one. That is, I get two regions of length n that intersect by n-1 characters.
It would make my paper immensely clearer if I had a succinct way of stating this relationship. For a while I simply shoved "mis-" and "overlapped" together and said "mislapped". Thus instead of saying, "R1 and R2 intersect completely minus one," it would say "R1 and R2 are mislapped," or "R1 mislaps R2".
But "mislap" is clearly awful. Would the brilliant minds of English.StackExchange help me find or invent a better term?
n
) you can say that they have an intersection value of from 0 (if they're disjoint) ton
(if they're identical), withn
-1 being the case outlined above.