UNIT 1 Flashcards

1
Q

What’s a gene?

A

1) A biological unit of heredity

2) A segment of DNA which codes for protien

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

What’s a genome? and its types?

A
A)
   1)Complete set of Genetic material in an organism
   2)Blueprint of life
   3)Encoded in DNA or RNA
   4)Consists Both Coding and Non-coding Sequences 
       of DNA and RNA
B)
    1)Prokaryotic genomes, 
    2)Eukaryotic Genomes, 
    3)Nuclear Genomes, 
    4)Mitochondrial genomes,
    5)Chloroplast genomes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is a histone?

A

1) Histones are highly basic proteins found in Eukaryotic cell nuclei
2) Combines ionically with DNA to form Nucleoprotien

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

What is a Nucleosome?

A

1)A structural unit of a eukaryotic chromosome, where each Nucleosome Consist of 8 histone proteins where DNA coils around 1.65 times

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

What are the 3 components of Bioinformatics?

A

1) Creating Databases
2) Development of algorithms and statistics
3) Data analysis and interpretation

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

What is Genome replication?

A

1) Most important task carried out in a cell
2) Replication begins with a pair of complimentary strand and ends with 2 pairs of complimentary strands
3) Parent strand during replication acts a template for the synthesis for the new strand

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

What are Strings, Graphs and Mapping Algorithms?

A

• Strings: Rabin Karp, finite automata, KMP algorithm,
Boyer Moore algorithm & suffix tree.
• Graphs: Interval graphs.
• Mapping: Restriction site Mapping Algorithms, Partial
digest,Double Digest Problem (DDP) – Simulated annealing, circular maps, Fitting data to maps.
• Radiation hybrid mapping and Optical mapping. Longest common substring and longest common subsequence

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

String?

A

Is an ordered succession of characters or symbols drawn from the finite set called Alphabets
1) Examples are mostly of 2 types
i)DNA-A,C,G,T
ii)20 Amino acids
2)String S is an ordered list of characters which is written left to right S = AACCGT
S(i)- i denotes to the character at position i

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

Substring?

A

Substring of S is formed from the consecutive Characters of S in the order as of S
Eg; TAC is a Substring of AGTAC not of ATGAC

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

Subsequence?

A

Subsequence of S is a sequence which is formed by removal of some characters
Eg: S = AATGCA ; Subsequence : ATG , TCA

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

|S|

A

Length of a string,Number of characters in it.

Eg: |S|=6

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

S[i]

A

The character occupying position i in a string s

s[1] = A, s[2] = A, s [3] = T

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

Empty String?

A

String of Length Zero is denoted by ε.

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

Supersequence?

A

Ex: W = TTA and U = CTTTAGCATTAA

When Sequence W is a subsequence of sequence U,Then U is said to be the Supersequence of W.

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

Concatenation?

A

Ex: s = GGCTA and t = CAAC, then st = GGCTACAAC
The concatenation of two strings s and t is denoted by st and is formed
by appending all characters of t after s
The length of st is |s|+ |t |.

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

Prefix and Suffix

A

Prefix: S = CTTTAGCATTAA; if j=4; s[1..4]= CTTT where s of the form s[1..j] for 0 ≤ j ≤ |s|

Suffix: S = CTTTAGCATTAA ; if i=5; s[5..|s|] = AGCATTAA where s is a substring of the form s[i..|s|] for a certain i such that 1 ≤ i ≤ |s|+1.
1 ≤ i ≤ |s|+1.

17
Q

Scoring Functions

A

Scoring functions denotes the score of aligning two sets of strings by means of aligning each characters in space.