1. Next-Generation Sequence Analysis
for Biomedical Applications
BIOC 4010/5010
Lecture 1
Dr. Dan Gaston
Postdoctoral Fellow Department of Pathology
Dr. Karen Bedard Lab
Bioinformatician, IGNITE Project
3. Overview: Lecture 1
• Introduction AKA “Why does this matter?”
• “Next-Gen” Sequencing
• Bioinformatics Workflows
• Types of Next-Gen Experiments
• Working with the Human Genome
• Slides available on slideshare:
– http://www.slideshare.net/DanGaston
4. Major Areas in Human Disease
Genomics
• Complex diseases
– Genome Wide Association Studies (GWAS)
• Cancer
– Tumour genomics (Driver mutations)
– Transcriptomics
• Mendelian disease
– Whole Genome/Exome Sequencing
– Transcriptomics
– Genetic Linkage
5. Diagnosing Genetic Diseases
• Genetic Counselors/Physicians order
individual testing of genes based on patient
phenotype
• For rare diseases or unusual phenotypes may
run tens to hundreds of tests
• …..EXPENSIVE (Easily thousands of dollars)
15. Human Disease Genomics at Dalhousie
• IGNITE: Identifying genetic mutations causing
rare mendelian diseases in Atlantic Canada
– 3 year, $2.5 million Genome Canada Project
– Currently working on >10 different diseases including
two inherited cancer’s
– Sequenced >20 individual exomes, 4 whole genomes,
and several transcriptomes
– More on Thursday…
• Dr. Graham Dellaire: Transcriptome sequencing
and analysis on multiple cancer cell lines
20. FastQ Quality Scores
Quality Score (Q) Probability of incorrect base call Base call accuracy
10 1 in 10 90%
20 1 in 100 99%
30 1 in 1000 99.90%
40 1 in 10000 99.99%
50 1 in 100000 100.00%
Q = -10 log10 P
22. General Genomics Workflow
Raw Data Quality Control of Raw
Analysis Data
Whole Genome Alignment to reference
Mapping genome
Variant Calling Detection of genetic variation
(SNPs, Indels, SV)
Linking variants to biological
Annotation
information
23. Short Read Mapping
…CCAT CTATATGCG TCGGAAATT CGGTATAC
…CCAT GGCTATATG CTATCGGAAA GCGGTATA
…CCA AGGCTATAT CCTATCGGA TTGCGGTA C…
…CCA AGGCTATAT GCCCTATCG TTTGCGGT C…
…CC AGGCTATAT GCCCTATCG AAATTTGC ATAC…
…CC TAGGCTATA GCGCCCTA AAATTTGC GTATAC…
…CCATAGGCTATATGCGCCCTATCGGCAATTTGCGGTATAC…
1) Report location of genome where read matches best
2) Minimize mismatches
3) Mismatches with lower quality bases better than
mismatches with higher quality bases
30. Transcriptomics: RNA-Seq
• Sequence the actively transcribed genes in a
cell line or tissue
– Only about 20% of genes are transcribed in
particular cell types
• Two types:
– Poly-A selection
– Total RNA + ribodepletion
• Many experimental questions can be
addressed
35. RNA-Seq
• Important to take in to account biological
variability. A sample of cells is a mixed population
– Replicates!
• Not suited for discovering polymorphisms due to
higher error rates introduced by reverse
transcription step (RNA -> cDNA)
• High false positive rates for fusion gene discovery,
novel exons, when low expression levels
38. Short Read Mapping: Placing Millions
of Reads on Human Reference
• Problem: Efficiently place millions of reads
(75bp – 200bp) accurately within 3.2Gb of
reference genome
• Problem: Read may match equally well at
more than one location (pseudogenes, copy
number variation, repetititve elements)
• Problem: Sequencing reads may be paired
39. Short Read Mapping: Brute Force
Method
Simple conceptually: Compare each query k-mer to all k-
mers of genome
Genome Size (N): 3.2 billion bases
K-mer length (M): 7
Number of comparisons((N-M + 1) * M): 21 billion
40. Solution
Index the Reference Genome
Indexing the reference is like constructing a phone
book, quickly move towards the relevant portion of the
genome and ignore the rest.
41. Short Read Alignment: Suffix Array
Split genome into all suffixes (substrings) and sort
alphabetically
Allows query to be searched against an alphabetical
reference, skipping 96% of the genome
Ex: banana Sorted:
banana a
anana ana
nana anana
ana banana
na nana
a na
42. Short Read Alignment: Binary Search
• Searching the index efficiently is still a
problem…
Index # Sequence Pos Pos
Search for GATTACA… 1 ACAGATTACC… 6
2 ACC… 13
3 AGATTACC… 8
4 ATTACAGATTACC… 3
5 ATTACC… 10
6 C… 15
7 CAGATTACC… 7
8 CC… 14
9 GATTACAGATTACC… 2
10 GATTACC… 9
11 TACAGATTACC… 5
12 TACC… 12
13 TGATTACAGATTACC… 1
14 TTACAGATTACC… 4
15 TTACC… 11
43. Short Read Alignment: Binary Search
• Searching the index efficiently is still a
problem…
Index # Sequence Pos Pos
Search for GATTACA… 1 ACAGATTACC… 6
2 ACC… 13
3 AGATTACC… 8
4 ATTACAGATTACC… 3
5 ATTACC… 10
6 C… 15
7 CAGATTACC… 7
8 CC… 14
9 GATTACAGATTACC… 2
10 GATTACC… 9
11 TACAGATTACC… 5
12 TACC… 12
13 TGATTACAGATTACC… 1
14 TTACAGATTACC… 4
15 TTACC… 11
44. Short Read Alignment: Binary Search
• Searching the index efficiently is still a
problem…
Index # Sequence Pos Pos
Search for GATTACA… 1 ACAGATTACC… 6
2 ACC… 13
3 AGATTACC… 8
4 ATTACAGATTACC… 3
5 ATTACC… 10
6 C… 15
7 CAGATTACC… 7
8 CC… 14
9 GATTACAGATTACC… 2
10 GATTACC… 9
11 TACAGATTACC… 5
12 TACC… 12
13 TGATTACAGATTACC… 1
14 TTACAGATTACC… 4
15 TTACC… 11
45. Short Read Alignment: Binary Search
• Searching the index efficiently is still a
problem…
Index # Sequence Pos Pos
Search for GATTACA… 1 ACAGATTACC… 6
2 ACC… 13
3 AGATTACC… 8
4 ATTACAGATTACC… 3
5 ATTACC… 10
6 C… 15
7 CAGATTACC… 7
8 CC… 14
9 GATTACAGATTACC… 2
10 GATTACC… 9
11 TACAGATTACC… 5
12 TACC… 12
13 TGATTACAGATTACC… 1
14 TTACAGATTACC… 4
15 TTACC… 11
46. Short Read Alignment: Binary Search
• Searching the index efficiently is still a
problem…
Index # Sequence Pos Pos
Search for GATTACA… 1 ACAGATTACC… 6
2 ACC… 13
3 AGATTACC… 8
4 ATTACAGATTACC… 3
5 ATTACC… 10
6 C… 15
7 CAGATTACC… 7
8 CC… 14
9 GATTACAGATTACC… 2
10 GATTACC… 9
11 TACAGATTACC… 5
12 TACC… 12
13 TGATTACAGATTACC… 1
14 TTACAGATTACC… 4
15 TTACC… 11
47. Binary Search
• Initialize search range to entire list
– mid = (hi+lo)/2; middle = suffix[mid]
– if query matches middle: done
– else if query < middle: pick low range
– else if query > middle: pick hi range
• Repeat until done or empty range
48. Applied to Human Genome
• In practice simple methods of indexing the
genome can create very large data structures
– Suffix Array: > 12 GB
• Solution: Apply complex procedures that allow
you to index and compress the data:
– Burrows-Wheeler Transform
– FM-Index
49. Short Read Mapping: Mapping Quality
• Have also ignored quality scores of reads
• Mapping Quality (for a read): Sum the quality
scores at mismatched bases for alignment
(SUM_BASE_Q(best)), also consider all other
possible alignments
MQ = -log10 (1 – (10-SUM_BASE_Q(best) /SUMi(10-
SUM_BASE_Q(i))) )
50. Short Read Aligners
• BLAT: BLAST-Like Alignment Tool
• MAQ: First to take in to account quality scores
• BWA: First to use Burrows-Wheeler Transform
• Bowtie: Ungapped alignment only
• Bowtie2: Allows indels
• … and many more
52. Genetic Variation
• dbSNP (NCBI) catalogues > 53 million Single
Nucleotide Variations (SNVs) in humans
– 38 million validated
– 22 million in genes
– 36 million with frequencies
• 50-80% of mutations involved in inherited
disease caused by SNVs
53. SNP vs SNV
• Technically a polymorphism is a variation that
doesn’t cause disease and is common in a
population
• What is common?
– Greater than 5% in a population a typical
definition
– Definition for rare ranges from < 0.5% to < 1.5%
56. Variant Calling: The Absurdly Simple
Way
• Algorithm:
– Count all aligned bases that pass quality threshold
(e.g. >Q20)
– If #reads with alternative base > lower bound (20%)
and < upper bound (80%) call heterozygous alt
– Else if > upper bound call homozygous alternative
– Else call homozygous reference
• …But what about base qualities for more than
keeping reads?
57. Improving Variant Calling
• MAQ (Mapping and Assembling with Quality):
– Short Read Mapper and Genotype Caller
– First to use base qualities for either
– Introduced mapping Quality
58. Improving Variant Calling
① Base quality can not be more reliable than
mapping quality of read
② At most individual can have two real
nucleotides at a position (two alleles)
① Only consider two most frequent nucleotides
② Simplify to two states: A and B
59. Improving Variant Calling
• Three Possible Genotypes:
– AA, BB, AB
• Construct a model that includes base quality
to estimate the probability of error
• Calculate the probability of each genotype
given the data and error rate
• Genotype with highest probability is called
64. Improving Variant Calling
• Two widely used tool sets for calling variants
– samtools (uses MAQ-type calculation)
– Genome Analysis Toolkit (GATK)
UnifiedGenotyper
• UnifiedGenotyper: Capable of calling both
indels and single nucleotide polymorphisms
(SNPs) and allele frequencies given multiple
samples
65. UnifiedGenotyper
Apply filters to discard poor reads and remove
biases:
① Duplicate reads
② Malformed reads (i.e. mismatch in #bases and base
qualities)
③ Bad mate (paired-end sequencing, paired reads map
to different chromosomes)
④ Mapping quality zero (maps to multiple locations
equally well)
⑤ Fewer than 10% mismatch on read in 20bp to either
side of position
67. Sequencer-Specific Error Models
If a base was miscalled, what is it most likely to be called
as instead?
Predicted Base
A C G T
A - 57.7 17.1 25.2
Actual C 34.9 - 11.3 53.9
Base
G 31.9 5.1 - 63.0
T 45.9 22.1 32.0 -
69. Decisions and Trade-Offs
• Option 1: Use stringent program options for
calling variants and hard filtering early to
produce only highly-confident call set.
70. Decisions and Trade-Offs
• Option 1: Use stringent program options for
calling variants and hard filtering early to
produce only highly-confident call set.
– Pro: Few false positives
– Con: Will miss real variants
71. Decisions and Trade-Offs
• Option 1: Use stringent program options for
calling variants and hard filtering early to
produce only highly-confident call set.
– Pro: Few false positives
– Con: Will miss real variants
• Option 2: Use less stringent (but reasonable)
options and filtering. Produce high-confidence
call set. Progressive filtering at later stage
72. Decisions and Trade-Offs
• Option 1: Use stringent program options for
calling variants and hard filtering early to produce
only highly-confident call set.
– Pro: Few false positives
– Con: Will miss real variants
• Option 2: Use less stringent (but reasonable)
options and filtering. Produce high-confidence
call set. Progressive filtering at later stage
– Pro: Won’t miss real variants
– Con: Many more false positives
73. Decisions and Trade-Offs
• Option 1: Use stringent program options for
calling variants and hard filtering early to produce
only highly-confident call set.
– Pro: Few false positives
– Con: Will miss real variants
• Option 2: Use less stringent (but reasonable)
options and filtering. Produce high-confidence
call set. Progressive filtering at later stage
– Con: False positives
– Pro: Won’t miss real variants
74. How Good Are My Calls?
• How many called SNPs?
– Human average of 1 heterozygous SNP / 1000
bases
• Fraction of variants already in dbSNP
• Transition/Transversion ratio
– Transitions 2x as common
• 2.8x when looking only at exons
77. Discovering Genetic Variants Causing
Mendelian Disease
4 million genetic variants
2 million associated with
protein-coding genes
10,000 possibly
of disease
causing type
1500 <1%
frequency in
population
78. Discovering Genetic Variants Causing
Mendelian Disease
4 million genetic variants
2 million associated with
protein-coding genes
10,000 possibly
of disease
causing type
1500 <1%
frequency in
Single Causal
population Genetic Variant
79. If a problem cannot be
solved, enlarge it.
--Dwight D. Eisenhower
92. Frequency of Polymorphisms:
Common vs Rare
• Mendelian disorders are caused by rare
variation, < 1-2% frequency in the relevant
population
• Leverage large projects aimed at assessing
genetic diversity in populations around the
world
– 1000 Genomes
– NHLBI Exome Sequencing Project
94. Population Matters
• Most variations in protein-coding genes
occurred fairly recently (last 20,000 years)
– Adaptation to agriculture and diet changes,
pathogen exposure and urban living
95. Population Matters
• Most variations in protein-coding genes occurred
fairly recently (last 20,000 years)
– Adaptation to agriculture and diet changes, pathogen
exposure and urban living
• Monogenic diseases have different prevalence in
different populations
– Cystic fibrosis in European population
– Hereditary hemochromotosis in Northern Europeans
– Tay-Sachs in Ashkenazi Jews
– Sickle-Cell anemia in Sub-saharan Africa populations
96. Population Matters
• Most variations in protein-coding genes occurred
fairly recently (last 20,000 years)
– Adaptation to agriculture and diet changes, pathogen
exposure and urban living
• Monogenic diseases have different prevalence in
different populations
– Cystic fibrosis in European population
– Hereditary hemochromotosis in Northern Europeans
– Tay-Sachs in Ashkenazi Jews
– Sickle-Cell anemia in Sub-saharan Africa populations
• Polygenic disorders
98. Exome Sequencing Project
• Multi-Institutional
• Total possible patient pool of > 250,000
individuals, well phenotyped
– Includes healthy individuals and diseased
• Currently 6700 exomes sequenced
– 4420 European descent
– 2312 African American
• 1.2 million coding variations
– Most extremely rare/unique
– Many population specific
99. IGNITE Project: Local Controls
• IGNITE: Tasked with studying rare monogenic
diseases identified in Atlantic Canada
• Atlantic Canada harbours several non-
represented population groups and sub-
groups…
100. IGNITE Project: Local Controls
• IGNITE: Tasked with studying rare monogenic
diseases identified in Atlantic Canada
• Atlantic Canada harbours several non-
represented population groups and sub-
groups…
– Acadians
– Native American
– Non-Acadian/European Descent
101. Population Frequency
• Mendelian disorders are rare
• If variation is in database, is it associated with
disease?
• Causal variation also needs to be rare
– Cutoff somewhere in the < 0.5 - < 1.5% range
– Should appear rarely or not at all in local controls
– Track with disease in family members under study
102. Predicting the Impact of Missense
Mutations
• Most use some level of evolutionary
conservation to determine how severe a
mutation is
– SIFT
– PolyPhen
– GERP++
– EvoD
103. Example: SIFT Algorithm
Multiple
Input Query
Homologs Sequence
Sequence
Alignment
Psi-BLAST Alignment
Multiple
Sequence PSSM Score
Alignment
Normalize
By most
frequent AA
104. Predicting Impact
• Other approaches include additional features:
– Protein structure information
– Site level annotation (active sites, binding sites,
etc)
– Protein domain information
– Biophysical properties of amino acids in that
position and of the substituted amino acid
105. Prediction Take-Away
The more conserved a site is the more likely
any substitution is to be deleterious
However: Current methods have pretty poor
performance, not suitable for clinical-level
diagnosis
106. Classifying Genetic Variants
4 million
variants
Intronic Exonic Intergenic
Amino Acid
Unknown Splice Site Silent Mutation Splice Site
Changing
Potential Potential
Disease Causing Disease Causing
Known
Known Genetic Stop Loss / Stop Missense
Polymorphism in
Disease Variant Gain Mutation
Population
108. Annotating Genes and Variants
• Is variant in a known protein-coding gene?
– What does the gene do?
4 million genetic variants
– What molecular pathways? 2 million associated with
protein-coding genes
– What protein-protein interactions? 10,000 possibly
of disease
– What tissues is it expressed in?
causing type
1500 <1%
frequency in
population
– When in development?
111. Genomic Intervals, Searching, and
Annotation
• Most common way of describing genomic
features is as an interval
• Multiple formats (BED, WIG, VCF, etc)
• In common for all is location:
– Chromosome
– Start Position of Feature
– End Position of Feature
– Annotations/Info (Optional)
112. Searching and Annotating: Interval
Trees
• Interval Trees allow efficient searching of all
overlapping intervals
• Easiest to make one tree per chromosome
• Given a set of intervals (n) on a number line
(chromosome) construct a tree
113. Interval Trees
All intervals to left All intervals to right
Node Contains:
- Centre point
- Intervals
sorted by start
- Intervals
sorted by end
117. Brain Calcification
• 84 genes in chromosome 5 region
• No likely homozygous or compound heterozygous
variants within region shared between two
patients
• 29 genes with at least one targeted region with
little or no sequencing coverage
• Many only lacked coverage in 5’ and 3’ UTRs
• Collaborators performed statistical tests for
possibly copy-number variations of targeted
regions using exome sequencing data