Theory and Models¶
Introduction¶
In MAVIS structural variants (SVs) are defined by a pair of breakpoints
And a breakpoint is defined by
chromosome
base-pair range (start, end). This has a length of 1 for exact calls and more for uncertain/non-specific calls
orientation. This is Left or Right with respect to the positive/forward strand. This defines which portion of the genome is ‘retained’
strand. (only applicable to stranded transcriptome libraries)
So then a breakpoint pair is any two intervals on the reference genome which are adjacent in the mutant genome
Evidence¶
There are many ways that single reads or paired-end reads can act as support for an SV call.
Types of Flanking evidence¶
One of the most confusing parts about working with contig and paired-end reads is relating them to the breakpoint so that you can determine which types will support an event. The flanking read types we outline here are similarly described by IGV. We have used similar coloring for the read pairs in the following diagrams to facilitate ease of use for those already familiar with viewing bam files in IGV.
Note
The major assumptions here are that the ‘normal’ read-pair is a read pair which has one read on the positive/forward strand and its partner on the negative/reverse strand. It is assumed that partners share a read name, as is the case for Illumina reads.
Deletion¶
For a deletion, we expect the flanking reads to be in the normal orientation but that the fragment size should be abnormal (for large deletions).
Insertion¶
Duplication¶
Compatible Flanking Pairs¶
For insertion and duplication events compatible flanking pairs are collected. This means that flanking pairs that support a duplication may be used as compatible flanking evidence for an insertion (in the same region) and similarly flanking pairs which support an insertion may be compatible flanking evidence for a duplication
Calculating the Evidence Window¶
We make some base assumptions with regards to paired-end read data:
Note
the distribution of fragment sizes approximately follows a normal distribution
Note
the most common fragment size is the unmutated ‘normal’ fragment
With the above assumptions we take the median fragment size to be the expected normal.
Given that we expect mutations and therefore abnormal fragment sizes, we use a modified method to calculate the median standard deviation (see code below). We calculate the squared distance away from the median for each fragment and then take a fraction of this to be ‘normal’ variation. So the most abnormal portion is ignored, assuming it is supposed to be abnormal. This results in a calculation as follows.
from statistics import median
import math
fragments = [abs(read.template_length) for read in reads] # the fragment sizes of the reads
f = 0.95 # fraction
m = median(fragments) # get the median fragment size value
X = [math.pow(i - m, 2) for i in fragments] # take the square error for each point
end = int(round(len(X) * f))
X = sorted(X)[0:end]
stdev = math.sqrt(sum(X) / len(X))
This gives us an idea of when to judge an fragment size as abnormal and where we expect our normal read pairs fragment sizes to fall.
As we can see from the diagram above, removing the outliers reproduces the observed distribution better than using all data points
We use this in two ways
to find flanking evidence supporting deletions and insertions
to estimate the window size for where we will need to read from the bam when looking for evidence for a given event
The _generate_window()
function uses the above concepts.
The user will define the median_fragment_size
the stdev_fragment_size
, and the stdev_count_abnormal
parameters defined in the VALIDATION_DEFAULTS
class.
If the library has a transcriptome protocol this becomes a bit more complicated and we must take into account the
possible annotations when calculating the evidence window. see
_generate_window()
for more
Calling Breakpoints by Flanking Evidence¶
Breakpoints are called by contig, split-read, or flanking pairs evidence. Contigs and split reads are used to call exact breakpoints, where breakpoints called by flanking reads are generally assigned a probabilistic range.
The metrics used here are similar to those used in calculating the evidence window. We use the max_expected_fragment_size as the outer limit of how large the range can be. This is further refined taking into account the range spanned by the flanking read pair evidence and the position of the opposing breakpoint.
Classifying Events¶
The following decision tree is used in classifying events based on their breakpoints. Only valid combinations have
been shown. see classify()
Assembling Contigs¶
During validation, for each breakpoint pair, we attempt to assemble a contig to represent the sequence across the breakpoints. This is assembled from the supporting reads (split read, half-mapped read, flanking read pair, and spanning read) which have already been collected for the given event. The sequence from each read and its reverse complement are assembled into contigs using a DeBruijn graph. For strand specific events, we then attempt to resolve the sequence strand of the contig.
Annotating Events¶
We make the following assumptions when determining the annotations for each event
Note
If both breakpoints are in the same gene, they must also be in the same transcript
Note
If the breakpoint intervals overlap we do not annotate encompassed genes
Note
Encompassed and ‘nearest’ genes are reported without respect to strand
There are specific questions we want annotation to answer. We collect gene level annotations which describes things like what gene is near the breakpoint (useful in the case of a potential promoter swap); what genes (besides the one selected) also overlap the breakpoint; what genes are encompassed between the breakpoints (for example in a deletion event the genes that would be deleted).
Next there are the fusion-product level annotations. If the event result in a fusion transcript, the sequence of the fusion transcript is computed. This is translated to a putative amino acid sequence from which protein metrics such as the possible ORFs and domain sequences can be computed.
Predicting Splicing Patterns¶
After the events have been called and an annotation has been attached, we often want to predict information about the putative fusion protein, which may be a product. In some cases, when a fusion transcript disrupts a splice-site, it is not clear what the processed fusion transcript may be. MAVIS will calculate all possibilities according to the following model.
For a given list of non-abrogated splice sites (listed 5’ to 3’ on the strand of the transcript) donor splice sites are paired with all following as seen below
More complex examples are drawn below. There are five classifications (SPLICE_TYPE
) for the different splicing patterns:
Retained intron (
RETAIN
)Skipped exon (
SKIP
)Multiple retained introns (
MULTI_RETAIN
)Multiple skipped exons (
MULTI_SKIP
)Some combination of retained introns and skipped exons (
COMPLEX
)
Pairing Similar Events¶
After breakpoints have been called and annotated we often need to see if the same event was found in different samples. To do this we will need to compare events between genome and transcriptome libraries. For this, the following model is proposed. To compare events between different protocol (genome vs transcriptome) we use the annotation overlying the genome breakpoint and the splicing model we defined above to predict where we would expect to find the transcriptomic breakpoints. This gives rise to the following basic cases.
Note
In all cases the predicted breakpoint is either the same as the genomic breakpoint, or it is the same as the nearest retained donor/acceptor to the breakpoint.
Literature¶
- Abyzov-2011
Abyzov,A. et al. (2011) CNVnator: an approach to discover, genotype, and characterize typical and atypical CNVs from family and population genome sequencing. Genome Res., 21, 974–984.
- Abyzov-2015
Abyzov,A. et al. (2015) Analysis of deletion breakpoints from 1,092 humans reveals details of mutation mechanisms. Nat. Commun., 6, 7256.
- Chen-2009
Chen,K. et al. (2009) BreakDancer: an algorithm for high-resolution mapping of genomic structural variation. Nat. Methods, 6, 677–681.
- Chen-2016
Chen,X. et al. (2016) Manta: rapid detection of structural variants and indels for germline and cancer sequencing applications. Bioinformatics, 32, 1220–1222.
- den-Dunnen-2016
den Dunnen,J.T. et al. (2016) HGVS Recommendations for the Description of Sequence Variants: 2016 Update. Hum. Mutat., 37, 564–569.
- Iyer-2011
Iyer,M.K. et al. (2011) ChimeraScan: a tool for identifying chimeric transcription in sequencing data. Bioinformatics, 27, 2903–2904.
- MacDonald-2014
MacDonald,J.R. et al. (2014) The Database of Genomic Variants: a curated collection of structural variation in the human genome. Nucleic Acids Res., 42, D986–92.
- McPherson-2011
McPherson,A. et al. (2011) deFuse: an algorithm for gene fusion discovery in tumor RNA-Seq data. PLoS Comput. Biol., 7, e1001138.
- Rausch-2012
Rausch,T. et al. (2012) DELLY: structural variant discovery by integrated paired-end and split-read analysis. Bioinformatics, 28, i333–i339.
- Robertson-2010
Robertson,G. et al. (2010) De novo assembly and analysis of RNA-seq data. Nat. Methods, 7, 909–912.
- Yates-2016
Yates,A. et al. (2016) Ensembl 2016. Nucleic Acids Res., 44, D710–D716.
- Ye-2009
Ye,K. et al. (2009) Pindel: a pattern growth approach to detect break points of large deletions and medium sized insertions from paired-end short reads. Bioinformatics, 25, 2865–2871.
- Saunders-2012
Saunders,C.T. et al. (2012) Strelka: accurate somatic small-variant calling from sequenced tumor–normal sample pairs. Bioinformatics, 28, 1811–1817.
- Haas-2017
Haas,B et al. (2017) STAR-Fusion: Fast and Accurate Fusion Transcript Detection from RNA-Seq. doi: https://doi.org/10.1101/120295