1 Purpose Flashcards

1
Q

1 Purpose of Bioinformatic

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

1.1 Adleman Travelling Sales Problem

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

1.2 DNA as Information Storage

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

2 Alignment

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

2.1 Longest Common Subsequence

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

2.2 Needleman-Wunsch

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

2.2.1 Global Alignment Problem

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
  1. 3 Smith-Waterman
    1. 1 Local Alignment Problem
  2. 3.2 Scoring Gaps
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

2.4 Affine Gap

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

2.5 Banded Dynamic Programming

Prefix

Suffix

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

2.6 Nussinov RNA Folding

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

3 Trees and Phylogeny

3.1 Distance Matrices to Evolutionary Tree

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

3.2 Additive Phylogeny

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

3.3 Least Squares Distance Based Phylogeny

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

3.4 Ultrametric Evolutionary Trees

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

3.5 Neighbour Joining

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

3.6 Character-Based Tree Reconstruction

A
18
Q

3.7 Small Parsimony Problem

A
19
Q

3.8 Large Parsimony Problem

A
20
Q

3.9 Progressive Alignment

A
21
Q

4 Genome Sequencing

4.1 Assumptions - largely untrue

A
22
Q

4.2 Compute de Bruijn Graph given unknown genome

A
23
Q

4.3 Eulerian Graph Problem

A
24
Q

4.4 DNA Sequencing with Read-pairs

A
25
Q

4.5 Errors

A
26
Q

5 Clustering

A
27
Q

5.1 Lloyd Algorithm

A
28
Q

5.2 Soft Clustering

A
29
Q

5.3 Hierarchical Clustering

A
30
Q

5.4 Markov Clustering Algorithm

A
31
Q

5.5 Stochastic Neighbour Embedding

A
32
Q

5.5.1 t-SNE Algorithm

A
33
Q

5.6 Burrows Wheeler Transform

A
34
Q

6 Genome Assembly and Pattern Matchin

A
35
Q

6.1 Genome Compression

A
36
Q

7 Hidden Markov Models

  1. 1 Genomic Sequencing
    1. 1 Genome Analysis
A
37
Q
  1. 2 HMM Definition
A
38
Q

Main Question 1 EVALUATION

A
39
Q

Main Question 2 DECODING

A
40
Q

Main Question 3 LEARNING

A
41
Q
  1. 3 GeneScan
  2. 3.1 Features
A
42
Q

7.4 Transmembrane HMM

A