Lec 6&7 Flashcards

1
Q
  • is an evolutionary term.
  • having common evolutionary origin
A

Sequence homology

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

is a gene inherited in two species by a common ancestor.

A

homologous gene

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

Homologous genes in different species performing the same function

A

orthologs

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

aligns and compares two sequences along their entire length

A

global sequence-alignment

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

algorithm that drives global alignment is?

A

Needleman Wunsch algorithm

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

Global alignment works the best when the sequences are?

A

similar in character and length

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

algorithm that drives local alignment is?

A

Smith-Waterman algorithm.

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

Global Alignment
Suitable for similar and equal length sequences
T/F?

A

T

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

Global Alignment
Suitable for partially similar, different length and conserved region containing sequences
T/F

A

F, Local Alignment

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

useful in identifying conserved sequence segments across the sequences being aligned.

A

Multiple sequence alignments

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

Identical amino acids are indicated by?

A

star (*)

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

strongly and weakly similar substitutions are indicated by?

A

colon (:) and a dot (.).

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

Specific combination of secondary structures organized into a characteristic three dimensional structure or fold.

A

Domains

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

Groups of proteins that have the same domain arrangement or that are conserved along the whole sequence.

A

Families

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

Structural units always found in two or more copies that assemble in a specific fold.

A

Repeats

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

Region of domains containing conserved active or binding residues, or short conserved regions present outside domains that may adopt folded conformation only in association with their binding ligands.

A

Motifs

17
Q

Functional residues (active sites, disulfide bridges, post-translation modified residues).

A

Sites

18
Q

sequence found in the database, suspected as homologous

A

Hit

19
Q

allows a DNA or protein query sequence to be compared with sequences in the database.

A

BLAST algorithm

20
Q

searching is that homologous sequences are likely to contain a short, high-scoring similarity region.

A

main idea behind BLAST

21
Q

searches a nucleotide database using a nucleotide query

A

blastn

22
Q

searches a protein database using a protein query

A

blastp

23
Q

searches a protein database using a translated nucleotide query

A

blastx

24
Q

searches a translated nucleotide database using a protein query

A

tblastn

25
Q

searches a translated nucleotide database using a translated nucleotide query

A

tblastx

26
Q

(blastp) is useful in identifying these proteins.
T/F?

A

F, not useful

27
Q

is designed to detect weak relationships between the query sequence and other sequences in the database that are not necessarily detectable by standard BLAST searches.

A

(PSI-BLAST)

28
Q

is designed to search the database for proteins that are significantly related to the query sequence and also contain a pattern.

A

(PHI)

29
Q

searches for significantly similar sequences to both a query sequence and a signature.

A

PHI-BLAST

30
Q

is dependent on the database size and the query length.

A

E-value

31
Q

is the expectation value that indicates the number of alignments with a score ≥S that one can expect to find by chance in a database of size N.

A

E-value

32
Q

bit score is dependent on?

A

sequence length