Why Breakpoint Harmonization Matters
A structural variant (SV) may be reported differently by two sequencing pipelines even when both calls describe the same underlying event. One caller may place a deletion boundary a few bases earlier, another may represent the same event with a slightly different interval, and a third may fail to call it in a particular sample. Conversely, two calls can overlap substantially while representing different events or different copy-number changes. Harmonization is the process of applying explicit rules to decide which calls should be treated as the same event for comparison across samples or studies.
The decision matters before comparing frequencies or constructing an association data set. If one event is split into several labels, its carriers may be divided across analyses. If distinct events are merged, carriers of different changes may be treated as if they carried the same variant. A reliable analysis therefore defines matching criteria in advance, documents them, and preserves the original calls so that a harmonized grouping can be checked.
Define the Matching Rule Before Comparing Calls
For interval-based calls, use a consistent reference genome assembly and coordinate convention. In this tutorial, intervals are 1-based and closed: an interval \([a,b]\) includes both endpoint bases and has length \(b-a+1\). Two calls cannot be compared reliably if their coordinates refer to different assemblies or if one file's coordinate convention has not been converted to the other's.
At minimum, compare chromosome and event type. A deletion should not match a duplication merely because their intervals coincide. For copy-number events, the direction of dosage change is relevant: a loss and a gain are not the same event. Inversions and insertions also have distinct representations and should not be matched to deletions or duplications solely by interval similarity. If a study distinguishes subtypes or orientations that matter to the scientific question, the rule should require those to agree too.
For two calls on the same chromosome with intervals \(A=[a_1,a_2]\) and \(B=[b_1,b_2]\), define their overlap length \(L_{\mathrm{ov}}\) and reciprocal overlap fractions as follows. The fractions express how much of each call is covered by the other.
A common interval criterion requires both \(R_A\) and \(R_B\) to be at least a prespecified threshold \(\rho\). Requiring both fractions guards against a short interval lying entirely inside a much longer one: the shorter interval could be fully covered even though only a small fraction of the longer call overlaps. A complementary breakpoint criterion may require the absolute differences between the left endpoints and between the right endpoints to be no greater than a tolerance \(\delta\) bases.
These are rule components, not universal biological constants. The threshold \(\rho\) and tolerance \(\delta\) should be chosen for the event class, sequencing resolution, and study purpose, then applied consistently. Some analyses use reciprocal overlap without endpoint constraints; others use endpoint tolerance or confidence intervals around uncertain breakpoints. The chosen policy must say which criteria are required and how uncertainty is handled.
Worked Example: Two Calls With Similar Deletion Boundaries
Suppose two hypothetical callers report deletions on the same chromosome and reference assembly: call A is \([100,200]\), and call B is \([108,205]\). Both are classified as deletions. Use \(\rho=0.80\) and \(\delta=10\) bases, requiring both reciprocal overlap and endpoint criteria.
The interval lengths are \(200-100+1=101\) bases for A and \(205-108+1=98\) bases for B. Their overlap is \([108,200]\), so \(L_{\mathrm{ov}}=200-108+1=93\) bases.
Both fractions exceed \(0.80\). The left-endpoint difference is \(|100-108|=8\) bases, and the right-endpoint difference is \(|200-205|=5\) bases. Both are at most 10. The calls therefore satisfy this specified matching rule. This conclusion is conditional on the calls being on the same assembly and having compatible event classifications; the arithmetic alone does not establish biological identity.
Breakpoint Tolerance, Uncertainty, and Event Representation
Breakpoint tolerance acknowledges that estimated boundaries can vary between callers or samples. It is not a license to ignore location. A large \(\delta\) can cause nearby but distinct events to be grouped, while a very small \(\delta\) can split calls for one event when the data do not support base-level precision. Interval overlap and endpoint tolerance provide related but not identical information: a long interval can have substantial reciprocal overlap despite a boundary difference that exceeds a chosen tolerance.
Some callers report breakpoint confidence intervals rather than one precise endpoint. A confidence interval describes uncertainty in the breakpoint estimate; it is not the same thing as the called variant's affected interval. A harmonization protocol can compare point estimates with a fixed tolerance, or can define a rule for overlapping breakpoint uncertainty intervals. These approaches should not be mixed silently. For example, calling two breakpoints compatible whenever their uncertainty intervals overlap can be permissive when those intervals are wide, so the uncertainty widths and the policy should be retained for review.
Interval overlap is not appropriate for every event representation. Insertions may be represented by an insertion site rather than a span of affected bases. Such calls need a site-distance rule, and, when available and relevant, agreement in inserted sequence or insertion subtype. A zero-length or one-base placeholder should not be treated as an ordinary interval and evaluated with reciprocal overlap as though it had meaningful span. The same principle applies to complex events: the representation and matching criteria must reflect the event structure being compared.
Worked Example: High Overlap Does Not Guarantee a Match
Two hypothetical deletion calls on the same chromosome are A \(=[100,300]\) and B \(=[110,180]\). Both are deletions. With \(\rho=0.80\), calculate reciprocal overlap and compare the endpoints using \(\delta=20\) bases.
The lengths are \(201\) bases for A and \(71\) bases for B. Since B is contained within A, the overlap is 71 bases.
The left-endpoint difference is \(|100-110|=10\) bases, which is within tolerance. The right-endpoint difference is \(|300-180|=120\) bases, which exceeds tolerance. The calls fail both the requirement that \(R_A\geq0.80\) and the right-endpoint condition. The fact that the shorter call is entirely contained within the longer one does not make them a match under this rule. Whether they represent related biology may require further evidence, but they should not be collapsed automatically by interval containment.
Resolve Candidate Matches Without Losing Distinctions
A call can have more than one plausible match, especially in regions with recurrent events or dense call sets. Pairwise similarity is not necessarily transitive. Call A may satisfy the rule against B, and B may satisfy it against C, while A does not satisfy it against C. Consequently, it is unsafe to assume that every chain of pairwise matches defines one unambiguous event group.
Worked Example: A Pairwise Matching Chain
Consider three hypothetical deletions on the same chromosome: A \(=[100,200]\), B \(=[108,208]\), and C \(=[116,216]\). Use \(\rho=0.80\) and \(\delta=10\) bases, requiring both criteria.
For A and B, the overlap is \([108,200]\), of length 93. Both intervals have length 101, so each reciprocal overlap is \(93/101=0.9208\). Their endpoint differences are 8 and 8 bases. Thus A matches B.
For B and C, the overlap is \([116,208]\), also 93 bases, and each interval has length 101. Each reciprocal overlap is again \(93/101=0.9208\), with endpoint differences of 8 and 8 bases. Thus B matches C.
For A and C, the overlap is \([116,200]\), of length 85. Each interval has length 101, giving reciprocal overlap \(85/101=0.8416\), which exceeds 0.80. However, both endpoint differences are 16 bases, exceeding \(\delta=10\). A does not match C under the full rule. Therefore, the pairwise rule alone does not determine whether A, B, and C should all be placed in one group. A protocol must state how to resolve such chains, for example by requiring each call to meet the rule against a designated representative, or by using an explicitly defined clustering procedure followed by review of group-wide compatibility.
A representative-based rule makes the decision reproducible but can depend on which call is chosen as representative. A clustering method can also have choices that affect group membership. Whichever policy is used, retain the pairwise comparisons and flag groups whose members are not mutually compatible. Avoid silently taking connected components of a match graph: that procedure joins any calls linked by a path, including the A-to-C mismatch in the example.
The following sequence makes the decision process explicit.
Confirm the reference assembly, coordinate convention, chromosome, event type, and any required subtype or orientation fields.
Calculate overlap and endpoint differences for interval calls, or apply the declared site-based criteria for insertions and other non-interval representations.
Apply a prespecified representative or clustering policy, retain uncertainty information, and flag ambiguous or non-mutually-compatible groups.
Record which original calls were assigned to each harmonized event and retain the rule and parameters used to make the assignment.
Consequences for Association Grouping
Harmonization determines which calls can contribute to the same event-level genotype or carrier indicator. Suppose two studies report different breakpoint estimates for one deletion in a sample. If those calls are harmonized as one event, the sample should not be counted as carrying two independent events merely because it has two records describing the same call. Conversely, if two calls fail the declared criteria, merging them can assign a sample to the wrong event group.
This decision is upstream of association testing. It defines the variant labels and the mapping from call-level records to analysis-level observations; it does not itself establish an association or a causal effect. When converting to a genotype or dosage representation, follow the event's copy-number coding and the analysis specification. Do not add dosages simply because multiple records were matched to one event: first determine whether they are duplicate descriptions of one call or distinct alleles, and apply a consistent sample-level rule.
Worked Example: Avoiding Duplicate Carrier Records
In a hypothetical study, calls P and Q are both classified as deletions and satisfy a prespecified harmonization rule. Three samples have the following records: sample S1 has both P and Q called; sample S2 has P only; sample S3 has neither. Assume review confirms that S1's two records are duplicate descriptions of the same deletion, not two distinct alleles. For illustration, define a carrier indicator \(G_i\) for this harmonized event as 1 if sample \(i\) has at least one qualifying call and 0 otherwise.
S1 has at least one assigned call, so \(G_{\mathrm{S1}}=1\), not 2; the two records refer to one event. S2 also has a qualifying call, so \(G_{\mathrm{S2}}=1\). S3 has none, so \(G_{\mathrm{S3}}=0\). The resulting carrier vector is \((1,1,0)\) for S1, S2, and S3. This example illustrates record reconciliation only. If a person has multiple genuine alleles or distinct events, their representation must follow the prespecified genotype and analysis definition rather than this duplicate-record rule.
For cross-study comparisons, apply the same harmonization policy to all studies or explain any justified differences. Report the assembly, event-type requirements, overlap threshold, breakpoint tolerance, uncertainty policy, and ambiguity resolution procedure. Sensitivity checks using reasonable alternative thresholds can reveal whether an association grouping depends heavily on an arbitrary boundary, but they do not replace a primary rule defined before examining the results.
Common Mistake and Key Takeaway
- Wrong reasoning: “These calls overlap, so they must be the same variant.” Overlap alone ignores event type, the fraction of each interval covered, boundary differences, coordinate conventions, and competing matches.
- Correction: Require compatible event classifications and apply a declared location rule, such as reciprocal overlap plus endpoint tolerance. Treat ambiguous matches explicitly and preserve the original calls.
- Wrong reasoning: “If A matches B and B matches C, all three are automatically one event.” Pairwise matching need not be transitive.
- Correction: Specify the grouping policy and check group-wide compatibility rather than assuming that a chain of matches defines one event.
Check Your Understanding
Use the definitions and decision rules in this tutorial to answer the following questions.
- Two calls have the same interval but are classified as a deletion and a duplication. Should interval agreement alone harmonize them? Explain.
- For intervals \([50,149]\) and \([60,159]\), calculate their overlap length and reciprocal overlap fractions.
- Why can reciprocal overlap in both directions reject a short interval contained within a much longer one?
- What additional representation and matching considerations may be needed for an insertion call that is recorded at a site rather than across an interval?
- Give one reason that pairwise breakpoint matching may not define unambiguous event groups.
- If two records in one sample are confirmed duplicate descriptions of the same harmonized event, why should they not automatically be counted as two carriers or two alleles?