The algorithm for BLAST is based on Gate Biotechnology 2014 question paper

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Gate-Biotechnology-2014-solved-question-paper-->View question


The algorithm for BLAST is based on: (- Gate Biotechnology 2014 question paper)

(A) Dynamic Programming 
(B) Hidden Markov Model 
(C) k-tuple analysis 
(D) Neural Network


By:Aparna-Dasgupta

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

k-tuple analysis

 T - word or k-tuple score. This is the score that a short word or k-tuple must have in order for BLAST to consider it significant. It is a function of the scoring matrix used in the program. W - word length. This is the length of the word or k-tuple that is scanned. Larger values for W (8 or 9) are typical for DNA searches. Smaller values (3-4) are typical for protein searches. The longer the word size the faster the search. Words or k-tuples are normally assembled into HSPs. 

tarun101

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------
k-tuple analysis

In number theory, a prime k-tuple is a finite collection of values representing a repeatable pattern of differences between prime numbers. For a k-tuple (a, b, ...), the positions where the k-tuple matches a pattern in the prime numbers are given by the set of integers n such that all of the values (n + a, n + b, ...) are prime. Typically the first value in the k-tuple is 0 and the rest are distinct positive even numbers.

scribed

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!