BIF501 Final Term Dining Discussion

OBJECTIVES

1. Which statement is not true about optimal energy? Native Structure Is Always at The Global

Minimum

2. Which of the following main component of mass spectroscopy component according to their mass to change ratio? Detector System
3. _______ is exhaustive search approach. SEQUEST Algorithm
4. Bioinformatics requires ___________. Smart Mind & Internet Connected Computer
5. Which of the following does not affect the stability of alpha helix? Bulkiness
6. A sequence of genome is meaningless without___. Assembly
7. Brute Force is _____Pattern finding Algorithms. Approximate
8. LCS scoring mechanism is for _____________ Sequence Similarity Analysis
9. Physiological base approach _________________ Disease Centric
10. An association rule has two parts __________________ If and Then
11. Transfer of gene among organism is called ___________ Horizontal Gene Transfer
12. Eco R1 breakdown DNA at _______________ GAATTC
13. Programming language used for modeler ______________ Python
14. It is to compute the prefix function _______________ O(M)
15. Prob used by sequencing in hybridization have size ________ 8-32
16. Which is correct_____? Homology Vs Paralogy + Orthology
17. _______ helps in finding global alignment. Needleman Wunsch
18. Brute force algorithm uses every possible _____ to find the solution. L MER
19. LCS scoring award 1 for _______________ Match
20. __programming approach does not require prior sequence alignment. Dynamic Programming
21. Brute force is a ________________________ Motif Finding Problem
22. DNA array is also known as ___________ DNA Chip
23. GCG stand for ____________ Genetics Computer Group
24. Gene mapping is determining the_____ on chromosome. Location
25. MS2 genome has _______ amino acid.129
26. Method use fr lesd validation______________________ Virtual Screening
27. Use for embryonic development ____________________ Homeobox Genes
28. Concerned with the effect of genetic factors on reactions to drugs ___ Pharmacogenetics
29. Sequence in EMBL format start with ________________ SQ
30. An ordered sequence of symbols ___ Pattern
31. Deletion in alignment in Edit graph shows _____ East (Horizontal Arrow)
32. How many methods for lead validation? 5
33. Chou FASMAN algorithm helps to find ________________ Secondary Structure of Protein
34. Plant mitochondria contain genes __________ 150 – 200kb
35. Brute force is an _____ Pattern finding algorithm. Approximation Algorithm
36. Which identify the structure with minimum free energy ________ Ab Initio
37. Length of each line for FASTA algorithm should be _____________ Shorter Than 80 Or (60)
38. Genome rearrangement results in a change of __________ Gene Ordering
39. Human genome consists of repeats ________ 20 %
40. Responsible for protein function __________ Protein Structure
41. ______ pattern matches with k mismatches or differences. Approximate
42. We look for molecule which need to be selected as target and those molecules that cause disease _________ Target Discovery
43. GEO for ________. Gene Expression Omnibus
44. Intron start from5 end is____ ans 3´ end is___________. GT, AG
45. SINE is ______ bp long. 80 – 300
46. Needle man publish in _______________________________ 1970
47. Chou FASMAN algorithm was 1st used in _______ 1974 – 1978
48. The notion of spectral similarity with shared peaks count _____________ P1, P2-S1 and S2
49. Human genome project ___________________________ 1988
50. TCGGGATTTCC is in drosophila for activate _____________________ Immunity
51. BLOSUM 6 is good for _____________________ Un Gaped Alignment
52. Disease that are hereditary ____________________ 3000 – 4000
53. Computational technique uses for protein not present in database ______. DENOVO
54. Motif are found in ___________. Promoter
55. A simple way (but not the best) to score an alignment is to count 1 for each match and 0 for each mismatch. Simple Alignment Scores
56. Substitution matrices are the log-odds matrices used for scoring____ substitutions in pairwise alignments. Amino Acid
57. When amino Acids are dissimilar, mutations from one into the other occur less during evolution it will be__? Negative Score
58. Substitution scores can be derived from, (Match Model, Probabilistic Model)
59. The probability of two sequences is the product of probability of each amino acid, in the case

Of. (Unrelated Model, Random Model)

60. Day Hoff, Schwartz and Orcutt presented their famous PAM matrix in? 1978
61. ______do not capture true difference between short time substitutions and long-term ones. Day

Hoff Matrices

62. Which one can perform well only in case of closely related proteins. PAM Matrices
63. BLOSOM or BLOCKS database was derived in ____by Henikoff & Henikoff. 1992
64. BLOSUM62 is good for ___Alignments. Ungapped
65. PAM and BLOSUM are famous ___ matrices. Substitution
66. Smith-Waterman algorithm finds the best ____ alignment between two sequences. Local
67. Dynamic programming is used to find an _alignment of two sequences and its scores. Optimal
68. Needleman Wunch algorithm was developed by Saul B. Needleman and Christian D. Wunsch and published in. 1970
69. In needle man wunch algorithm while doing matrix filling is____ the sum of the cell to the left and the gap score. Horizontal Gap Score
70. ___was awarded by Noble prize after sequencing a virus having size 5386 nucleotides. Fred

Sanger

71. Human genome project was started in? 1988
72. After completion of genome project approximately ___ nucleotides were sequenced. 3 Billion
73. How many nucleotides could be reads in starting sequencing methods? 500 - 700
74. After completion of H.G.P, Shotgun sequencing was coming into being after? 20 Years
75. Shot gun sequencing is used when there will be_____ Amount of DNA sequence. Huge
76. In shot gun we use ____ for the breakdown of DNA into small pieces. Sonication
77. For obtaining shortest super string we use a technique. Shortest Super String Problem
78. Poly nomial algorithm is ____ for shortest super string problem. Unlikely
79. In sequencing hybridization to identify a fragment there was a small prob of ___ nucleotides size. 8 – 32
80. Which of the following is time consuming technique? Sequencing Hybridization, Human

Genome Project

81. Light directed polymer synthesis was develop by. Steve Fodor
82. Steve gave his sequencing technique in? 1991
83. 64-kb DNA array was built in 1994 by a company of California named as? Affymetrix
84. In an array of DNA chip each prob locate at a distance with? Known Location
85. What we use to determine the prob which is hybridized to DNA. Spectroscopic Detector
86. Fragment assembly is actually assemblage of fragments into? Entire Genome
87. How many %age of human genome consists of repeat sequence? 20%