Genomics and bioinformatics. Flashcards
1
Q
What is the definition of bioinformatics?
A
The science of collecting and analysing complex biological data such as the genetic code.
2
Q
Most things decrease in cost following Moore’s law, this was not the case for genome sequence after the development of NGS. What was the cost decrease from 2001 to 2014 for one megabase?
A
2001 $10k
2014 $0.10
3
Q
What is the bioinformatics gap?
A
The problem of storing and analysing all the genetic date provided from NGS.
4
Q
What two sequencing techniques are often used in health care?
A
Illumina Hiseq and Miseq
5
Q
What sort of sequencing produces ‘big data’?
A
NGS.
6
Q
Does Illumina Hiseq have a better read run or read depth?
A
Read depth- produces 8 billion reads of 150 bp on high output mode.
7
Q
What method of sequencing now takes up roughly 80% of the market?
A
Illumina.
8
Q
What format does a biological file have to be in?
A
Txt file. NOT IN A WORD PROCESSOR.
9
Q
What is the most common file format for biological data?
A
FASTA.
10
Q
What is found on the title line of a FASTA file?
A
> , identifier, description.
11
Q
How many characters can be on each line in a FASTA file?
A
60.
12
Q
When sequences are compared what can they be described to have?
A
A % identity.
13
Q
What is a padding character?
A
A - which is filled in to form a ‘gap’, this maximises the sequence identity. T
14
Q
What is sequence alignment used for?
A
Used to identify homology between sequences with a common ancestor.
15
Q
When using - to fill in gaps (padding character) what do you need to assume?
A
That each sequence is equivalent.
16
Q
What can sequence alignment be used to do other than work out a % identity (2 things)?
A
- Create short reads and contigs.
2. Used to map reads to a reference genome (resequencing).
17
Q
What can resequencing allow you to identify?
A
Sequence variants and transcribed regions of the genome, allowing to you quantify transcripts and the level of transcription through RNA seq.
18
Q
Would x– or -x- be more likely?
A
X– as caused by a single event. Both are still possible however.
19
Q
Scoring systems are used in sequence alignments. Matches are given a (+) score. What two events give a (-) score?
A
Gaps and mismatches.
20
Q
How do the penalties given to longer gaps slightly differ fro the penalties for shorter gaps?
A
In a longer gap the first (-) will get a minus score while the next can get a slightly lower penally as they only extend the gap.
21
Q
What are gaps also called in sequence alignment?
A
INDELs.
22
Q
What does calculating identities for sequences allow you to do?
A
Determine evolutionary relationships.
23
Q
What do sequence alignments allow you to create?
A
Contigs.
24
Q
Sequence alignments can be used to map reads to a reference genome. What is this process also called/
A
Resequencing.
25
Why would you want to resequenced a genome? (3 reasons)
1. Can identify sequence variants.
2. Identified transcribed regions
3. Quantify levels of transcription- RNAseq.
26
Alignment is more difficult with protein sequences. Why?
Not all amino acids are equivalent.
27
Amino acids are not all equivalent when it comes to making alignments. How does this effect the scoring?
Equivalent amino acids (i.e. same size and charge) are given less of a negative score.
28
What are two common scoring matrices?
PAM70 anf BLOSUM62.
29
Who produced the PAM70 matrix and can be classed as the first bioinformatician?
Margaret Dayhoff.
30
What percentage identify can be used on the PAM70 matrix?
30%.
31
How many mutants and proteins families did Margaret Dayhoff use to make the PAM70 matrix?
1571 mutations and 71 protein.
32
Alignments can be global. What does this mean?
An attempt is made to align the sequence across the entire genome.
33
For a global alignment to occur what do both sequences need to be?
Equivalent.
34
Who first proposed the fist global alignment algorithm?
Needleman and Wunsch.
35
How can local alignments be used to maximise alignment scores?
Can search subsequent lengths of the global sequences, this results in less gaps.
36
Who proposed the first local alignment algorithm based on the Needleman and Wunsch global alignment algorithm?
Smith and Waterman.
37
What is a simple way to visualise sequence alignments?
Dot plots.
38
How would inversions be visualised in dots plots?
Diagonal line (TR to BL) intersected by a diagonal line going the opposite direction, followed by the original diagonal line.
39
What is the definition of a multiple alignment?
Alignment of three or more sequences.
40
Why are multiple alignments considerably harder than pair alignments?
As the number if possible alignments increases exponentially for every sequence is added.
41
What method is applied to reduce the number of sequences examined in a multiple alignment?
Heuristic.
42
What does a multiple alignment involve originally?
An initial examination of a guide tree which gives an indication of the relationship between the species.
43
What sequences are aligned first in a multiple alignment?
Most commonly related sequences.
44
Once the most commonly related sequences have been aligned in a multiple alignment how are they treated?
As a single sequence.
45
What are four commonly used programmes used in multiple alignments?
Clutsal W, T-Coffee, MUSCLE and MAFFT.
46
What programmes use multiple alignments for their inputs?
Programmes that infer phylognetic trees.
47
What does 'BLAST' stand for?
Basic Local Alignment Sequence Tool.
48
What is BLAST a widely used method for?
Searching a sequence database to rapidly identify sequences similar to a query sequence.
49
Is BLAST heuristic or an algorithm?
Heuristic.
50
BLAST is heuristic. What does this mean?
It is not guaranteed to identify the best sequence (although it usually does.)
51
What is BLAST basically a fast version of?
Smith anf Waterman- although it is not an algorithm.
52
What does BLAST break the sequence into?
3 amino acids / 11 nucleotides by default.
53
What regions are often excluded from BLAST searches and why?
Regions of low complexity (e.g. regions that are made from a single nucleotide/ same amino acid) as these are relatively uninteresting regions.
54
How do BLAST searches work?
BLAST database searched for seed alignments which match the words in the query, these are then extended.
55
What does each BLAST hit have?
One or more HPS (High scoring pairs). These are local alignments with a score above a particular threshold.
56
What are the basic files produced by DNA sequences called?
Fastq files.
57
What two things do Fastq files include?
1. Sequence data.
| 2. Measure of the sequence quality.
58
What two features are there of a Fastq file headliner?
Begin with an @ sign and contain a unique read identifier.
59
During DNA sequencing each base is given a quality score. What can this score range between?
1-99.
60
During DNA sequencing each base is given a quality score ranging from 1-99. What does the score normally max out at?
60.
61
How are the quality scores assigned to each base calculated?
10log10P, where P is the probability of an error.
62
What does a quality score of 10 mean?
1 in 10 chance that the base is wrong.
63
What does a quality score of 20 mean?
1 in 100 chance that the base is wrong.
64
What does a quality score of 30 mean?
1 in 1000 chance that the base is wrong.
65
What do separator lines in Fastq files contain?
+.
66
How are quality scores stored?
In fast files in a series of letters, digits and punctuation. 33 is added to the score and they are converted to ASCII files.
67
Do letters or punctuation show a good quality score?
Letters. Punctuation shows a bad quality score.
68
After illumina sequencing how many Fastq reads do you get?
2.
69
What are 7 problems of whole genome shotgun sequencing?
1. Whole sequence unknown.
2. Coverage bias.
3. Sequencing errors.
4. Repeats.
5. Multiple replicons.
6. Contamination.
7. Circular genomes.
70
Why are circular genomes a problem in whole genome sequencing
As there is no obvious start and end and the whole thing overlaps.
71
What is the biggest issue for shotgun sequencing?
Repeats.
72
How can contamination be a problem in sequencing?
Two samples can be loaded into one tube.
73
When can repeats not be sequenced and what could solve this?
When they are longer than the inserts as you do not know the ends- could be solved by long read technologies.
74
Name two examples of long read technologies.
Pac, Oxford nanopore.
75
What is a common approach to assemble short reads while taking into account sequencing errors and repeats?
deBruijn.
76
What do the bubbles in a deBruijn graph represent?
Repeats.
77
What is one of key functions of sequencing software?
Resolving bubbles in deBruijn graphs.
78
What route is taken in a deBruijn graph?
The longest route.
79
What are the fixed length chunks of varying size on a deBruijn graph called?
Kmers.
80
What additional information does genome sequencing software use to resolve bubbles on a deBruijn graph?
Coverage levels and paired reads.
81
What happens if a bubble on a deBruijn graph can not be solved?
There is a break in the assembly.
82
As a read gets longer what happens to a deBruijn graph?
It gets simpler.
83
What does a circular deBruijn graph mean?
The whole genome is essentially a repeat.
84
How many ORFS are there in DNA?
6.
85
Why are there 3 ORFS per DNA strand?
As the genetic code is a triplet code.
86
Are stop codons AT or GC rich?
AT.
87
What BLAST program is used to look up nucleic acids in the nucleic acid database?
blastn.
88
What BLAST program is used to look up conceptional protein translocations in the conceptional protein translocation database?
tblastx.
89
What BLAST program is used to look up conceptional protein translocations in the peptide protein database?
blastx.
90
What BLAST program is used to look up peptide proteins in the conceptual protein translocations database?
tblastn.
91
What BLAST program is used to look up peptide proteins in the peptide protein database?
blastp.
92
How can large genes be identified in bacterial/archael species?
Through the presence of long ORFs.
93
Is it easier to identify long genes in bacterial/archael species in GC or AT rich genomes?
AT.
94
What three conserved sequences can indicate the start of a gene in bacterial/ archaeal species?
AUG, pribnow box, Shine Delgado sequence.
95
Why do codon sequences within genes often have a characteristic base composition?
Due to bias in codon usage.
96
Name a gene finding program and explain the basic approach that it uses.
Glimmer- identifies patterns in the genome to identify the longest ORFS and uses these to identify shorter genes.
97
Why is it harder to find eukaryotic genes in the genome?
As they contain no ORFS and contain introns.
98
What can identify the start of a sequence in eukaryotic genes?
Kozak sequence.
99
What two consensus sequences can identify the end of a eukaryotic gene?
Terminator consensus and the poly(A) signal.
100
What can indicate the presence of an intron in a eukaryote?
Donor and acceptor sites.
101
Why is gene prediction in eukaryotes hit and miss?
Alternative splicing patterns.
102
What is the role of the software GeneMark and is it a god piece of software?
To identify genes in eukaryotes despite them having alternative splicing patterns. Accuracy of this software is limited.
103
What experimental data can be used to improve gene prediction in eukaryotes?
EST sequences or RNA seq data.
104
Once a gene has been predicted how is its function often identified?
Homologous genes can be found using BLAST and the function of the gene can be inferred.
105
Common domains in predicted protein sequences can be identified using software such as _______ against databases such as _______.
HMMer, Pfam.
106
HMMer is a software package use to predict common domains with a protein sequences. What other functional elements an be identified with similar software packages?
tRNA, rRNA, ncRNA genes and common repeat elements.
107
Pipelines such as ______ in bacteria/ archaea and _____ in eukaryotes combine gene finding and gene annotating approaches rapidly allowing for the prediction of genes and a functional annotation.
Prokka, MAKER
108
Apart from resolving repeat regions, what is an advantage of using deBuijn graphs?
That the kmers can be stored in memory so require less RAM.
109
Removal of what can correct sequencing errors?
Rare k-mers.
110
What can be used to solve bubble son deBruijn graphs?
Pair end reads.
111
What does resequencing a genome allow you to do?
Investigate genetic variation within a population of a species.
112
What three things can be studied through resequencing the human genome?
1. Single gene disorders.
2. Complex gene disorders.
3. Cancer.
113
Resequencing can identify variants. What could this possibly be useful for?
Personalised medicine and genome editing methods such as CRISPR/Cas9.
114
What two functional genome technologies also rely on sequencing?
RNA-seq and chIP-seq.
115
How are Illumina sequencing reads stored?
Fastq files.
116
Many programs are available which will map short reads to a reference genome. What are the two most common?
1. BWA (Burrows Wheeler Aligner).
| 2. Bowtie 2.
117
What genome reference software allows a reference genome to be stored in a computer memory and efficiently searched?
BWA.
118
How much RAM does a computer need to search and store the reference genome?
2GB.
119
How are short identical matches found when comparing a sample to a reference genome?
Each read is compared with a short index on the reference genome to identify short identical matches called seed sequences. The alignments from the seed sequences are extended to include the rest of the read.
120
What is used to identify the best mapping position?
An alignment scoring system.
121
What is included in the alignment scoring system?
1. Number of matches
2. Number of mismatches
3. Base qualities
122
Not all mismatches are equally penalised in the alignment scoring system. How is this the case?
Lower quality bases are penalised less then higher quality mismatches.
123
What is often mapped independently?
Paired reads. The best mapping position also takes these into account though.
124
Each mapped read is given a mapping score. What does this score show?
The confidence that the read is derived from that position in the genome.
125
What reads have low mapping scores?
Ambiguously mapped reads, e.g. reads from repeat regions
126
What files are mapped reads usually stored in?
BAM files.
127
Mapped reads are stored in BAM files. What information is contained in these?
Details of which position on which chromosome the read is mapped to.
128
What is the 'depth of coverage'?
The number of reads that overlap a particular position.
129
What is a 'pile up plot'?
A bar chart showing the variation of depth coverage.
130
Would would a 1 times coverage make it impossible to do and what times coverage should be carried out to overcome this?
Distinguish between errors and real differences between the sequences. A 50 times read coverage allows you to make the assumption that any errors are random.
131
What programs can be used to identify common SNPs and small Indels?
GATK and SAM tools.
132
GATK and SAM tools can be sued to identify common SNPS. How do these programs work?
They use a probabilistic model to distinguish real homozygous or heterozygous variants from sequencing errors.
133
What is the role of the program SNPef?
Predicts the effect of a SNP.
134
If a SNP is synonymous what does this mean?
It does not change an encoded protein.
135
What does dbSNP do?
Removes commonly found SNPs from the dataset. This is because common variants are less likely to be clinically relevant.
136
What controls need to be included when looking at SNPs?
Affected and non affected individuals. Ideally controls are related or are very genetically similar.
137
How can SNPS be validated?
PCR and Sanger.
138
What can be the cause of random or systemic error in sequencing?
When the sequencer outputs the wrong base call.
139
What does a mapping error involve?
A mapper placing the read in the incorrect position of the genome.
140
What does sample contamination in sequencing involve?
The sampler containing different DNA with a different sequence from a different source.
141
What does sequence contamination in sequencing involve?
Reads from a sample being mislabelled.
142
Errors in sequencing can come from both sequences. True or false?
True.
143
Do all changes in nucleotide sequences result in a SNP?
No.
144
What are structural variants a result of?
Larger scale chromosome rearrangements.
145
Structural variants are a result of larger scale chromosome rearrangements. Name 5 examples of these?
1. Insertions.
2. Deletions.
3. Duplications/copy number variants.
4. Inversions.
5. Translocations.
146
What can coverage depth allow you to detect?
Structural variants in resequencing.
147
What can read pairs be used to detect?
Structural variants in resequencing.
148
What can split reads detect?
Deletions in the reference.
149
What can show novel insertions?
Assemblies?
150
What is perhaps the simplest form of functional genomics?
GWAS.
151
What regions of the genome do GWAS identify?
Regions associated with a particular phenotype by statistical association.
152
Through examine lots of cases in a GWAS what cab be identified?
Variants that are over represented in some cases.
153
What shows the data set for GWAS?
Manhattan plots.
154
Why can GWAS be misleading?
Correlation doesn't always mean causation. Further studies are often needed to establish molecular mechanisms underlying the phenotype.
