All toffees are chocolates. Some toffees are not good for health. (a) Some chocolates are not good for health (b) Some toffees are good for health (c) No toffees are good for health (d) Both (a) and (b).1 3233
If ?segment? is coded as rffndou, then ?ritual? is coded as (a) shutbm (b) qjutbk (c) qhutbk (d) qhubtk3 8069
If ?football? is ?cricket? ,?cricket? is ?basketball? ,?basketball? is ?volleyball?,?volleyball? is ?khokho? and ?khokho? is cricket, which is not a ball game? (a) cricket (b) football (c) khokho (d) basketball.3 6704
Which of the following is a recursive set of production (a) S ?> a|A, A ?> S (b) S ?> a|A, A ?> b (c) S ?>aA, A?>S (d) None of these.2 8499
Define perl and clustalW problem?1328
How to find patterns in noisy data?1 1838
Explain microarray data clustering ?1 2336
Derive e-value ?2 5781
Explain Homology modelling?1 2746
What does the ultrametric property of a tree tell us about the evolutionary process?
What is a DNA array?
what is the principle involved in Biometry?
What are the main differences between parsimony,distance and likelihood-based algorithms?
Define perl and clustalW problem?
How to find coexpressed genes on NCBI GEO?
How long will a train 100m long traveling at 72kmph take to overtake another train 200m long traveling at 54kmph?
Suppose the Blast search returned 100 hits. Of these, 17 were false positives and we knew that there were 165 sequences in the database which should have returned a hit with our sequence. How many false negatives were there, and what is the sensitivity and selectivity of Blast in this instance?
How do ESTs work?
Bootstrap analysis evaluates evolutionary trees by sampling columns from the original alignment with replacement (multiplying or removing some of them) and computing a proportion of times that a particular branch appears in the resulting trees. What is the main idea behind this approach?
Can DeCypher be used for protein struc-ture modeling?
How to find a sequence of dna molecule?
Draw the E-R diagram for the database of a departmental store having the following relational database scheme Employees(e-no, address) Department(d-name) work-n(e-no, d-name) Looking-after(d-name, e-no) Item (item-no, brand-name, model-no, cost-price, sale-price)
Integrate 3x + 5 / (x3-x2-x+1)?
Explain about needleman-wunsch algorithm?