Bioinformatics Flashcards

1
Q

Substitution

A

Sequence change where one nucleotide is replaced by another nucleotide

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

Transition

A

Change from one purine to another purine (A>G) OR change rom one pyrimidine to another pyrimidine (C>T)

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

Transversion

A

Change from purine to pyrimidine (A>T), and vice verse (C>G)

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

Insertion

A

One or more nucleotides are inserted AND where the insertion is not a copy of a sequence immediately 5’

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

Duplication

A

Copy of one or more nucleotides are inserted directly 3’ of the original copy of that sequence

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

Deletions

A

One or more nucleotides are deleted

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

Identity

A

The extent (%) to which two (nucleotide or amino acid) sequences have the same residues at the same position in an alignment

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

Similarity

A

The extent (%) to which nucleotide sequences are related

NOTE: expressed as %sequence identity and/ or %positive substitutions

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

Differentiate homologs vs paralogs

A

Homolog: genes inherited from a common ancestor between 2 different species

Paralog: duplicate genes within the same species

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

Alignment

A

Aligning nucleotide/ amino acid residues of two or more sequences so that differences can be identified

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

Pairwise vs Multiple alignment

A

Pairwise: alignment of two sequences

Multiple: alignmnet of 3 or more sequences

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

Differentiate Global vs Local alignment types

A

Global: align complete sequences

Local: identify only most similar segments/ sequence patterns/ motifs

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

Differentiate Dynamic Programming vs BLAST

A

Dynamic programming:
- more precise but requires large computer load
- global and local alignmnet

BLAST:
- “basic local alignment search tool”
- a heuristic method; takes shortcuts to get an approximation
- local alignmnet

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

“The __ the E-value, the less likely a match is due to chance”

A
  • “The smaller the E-value, the less likely a match is due to chance”
  • longer sequences will have higher E-values
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Mnemonic: Purines

A

“Pure silver;” Pur = AG

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

blastn

A
  • for searching with shorter nucleotide sequences, between species (cross-species)
  • nucleotide > nucleotide
17
Q

megablast

A

default, intra-species comparison (within one species) of nucleotides

18
Q

discontiguous megablast

A

for cross-species comparison (between species) of nucleotides

19
Q

List 3 blastn algorithms

A
  1. megablast
  2. blastn
  3. discontiguous megablast
20
Q

blastx

A

translated nucleotide > protein

21
Q

tblastn

A

protein > translated nucleotide

22
Q

blastp

A

protein > protein