Which of the following is incorrect?(a) Smith–Waterman algorithm is the fastest(b) Smith–Waterman algorithm is comparatively slower method(c) To speedup up comparison, heuristic methods are used(d) Heuristic algorithms perform faster searchesThe question was posed to me during an interview.This intriguing question originated from Heuristic Database Searching topic in portion Database Similarity Searching of Bioinformatics

Which of the following is incorrect?(a) Smith–Waterman algorithm is

1.	Which of the following is incorrect?(a) Smith–Waterman algorithm is the fastest(b) Smith–Waterman algorithm is comparatively slower method(c) To speedup up comparison, heuristic methods are used(d) Heuristic algorithms perform faster searchesThe question was posed to me during an interview.This intriguing question originated from Heuristic Database Searching topic in portion Database Similarity Searching of Bioinformatics
Answer» The correct choice is (a) Smith–Waterman algorithm is the fastest For explanation: Searching a LARGE DATABASE using the dynamic programming methods, such as the Smith–Waterman algorithm, ALTHOUGH accurate and reliable, is too slow and impractical when computational resources are limited. To speed up the comparison, heuristic methods have to be used. The heuristic algorithms perform faster searches because they examine only a fraction of the possible ALIGNMENTS EXAMINED in regular dynamic programming.

Discussion

No Comment Found

Related InterviewSolutions

The rigorous dynamic programming method is normally not used for database searching because it is slow and computationally expensive.(a) True(b) FalseI have been asked this question by my college professor while I was bunking the class.This interesting question is from Database Searching with the Smith topic in division Database Similarity Searching of Bioinformatics
In heuristic methods, speed doesn’t vary with the size of database.(a) True(b) FalseI have been asked this question during an interview.This key question is from Heuristic Database Searching topic in section Database Similarity Searching of Bioinformatics
Sensitivity refers to the ability to find as many correct hits as possible.(a) True(b) FalseThe question was asked by my school principal while I was bunking the class.My question is based upon Heuristic Database Searching topic in division Database Similarity Searching of Bioinformatics
The positional difference for each word between the two sequences is obtained by ________ the position of the ______ sequence from that of the _______ sequence and is expressed as the offset.(a) subtracting, second, first(b) adding, second, first(c) adding, first, second(d) subtracting, first, secondThis question was posed to me during an interview for a job.This key question is from FASTA topic in section Database Similarity Searching of Bioinformatics
Score can be negative in Smith–Waterman algorithm.(a) True(b) FalseThe question was asked during an internship interview.I'd like to ask this question from Database Searching with the Smith in portion Database Similarity Searching of Bioinformatics
The gapped portion in the diagonals represents matches in FASTA.(a) True(b) FalseThis question was addressed to me in an international level competition.My question comes from Comparison of FASTA and BLAST topic in chapter Database Similarity Searching of Bioinformatics
BLAST often produces several short HSPs rather than a single aligned region.(a) True(b) FalseI have been asked this question by my school principal while I was bunking the class.My query is from Comparison of FASTA and BLAST topic in portion Database Similarity Searching of Bioinformatics
The final step involves pairwise alignment by extending from the words in both directions while counting the alignment score using the same substitution matrix.(a) True(b) FalseI have been asked this question during an interview for a job.My question is based upon Basic Local Alignment Search Tool (BLAST) topic in portion Database Similarity Searching of Bioinformatics
Which of the following is not a variant of BLAST?(a) BLASTN(b) BLASTP(c) BLASTX(d) TBLASTNXI have been asked this question in an online interview.My question is taken from Basic Local Alignment Search Tool (BLAST) topic in section Database Similarity Searching of Bioinformatics
The initiation of FASTA format has ____ symbol.(a) >(b)

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment