Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / kathirvel. m
The Expect value (E)is a parameter describes the number of
hits one can expect to see by chance of searching a database
of particular size and matching between them. there is a
proportional relation of E with matching similarity. When E
score decreases the matching is significantly increases. The
lower the E vale or closer to zero that predicts the more
significant match is. The E value is subject to change based
on query sequence length. For example short alignments shows
relatively high E values. Thus because of short length have
a high probability of occurring the match on the database by
a chance. But in long sequence shows minimal match as
partial (or) incomplete between the strands that shows low E
value when compared to shorter one.
| Is This Answer Correct ? | 4 Yes | 2 No |
Post New Answer View All Answers
what is the image of point (3,8) in the line x + 3y = 7 ?
How to Insert Genomic DNA into yeast ?
How long will a train 100m long traveling at 72kmph take to overtake another train 200m long traveling at 54kmph?
How to predict the function of a gene (product)?
What are the current challenges in the Pharmaceutical and biotechnology sectors?
How can we find the direction of an nucleotide substitution, for example; C to T or T to C?
What are oesophageal molecular markers?
Did integral membrane transport proteins arise as an independent protein class or from other types of proteins?
What is the product of the irrational roots of the equation (2x-1)(2x-3)(2x-5)(2x-7)=9?
what is an active ? (UML)
Is there is best online Training for Bioinformatics
Integrate 3x + 5 / (x3-x2-x+1)?
Suppose you used the NCBI Blast server to look for a match to a fruit-fly gene. Suppose further that the best alignment contained this section of an alignment: Hit from database: XXXXXXXXXXXXXXNFSTSQ User sequence: SLEAEAAPASISPSNFSSSQ What do the Xs signify?
What are the main differences between parsimony,distance and likelihood-based algorithms?
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?
