Ask Questions, Get Answers

Want to ask us a question? Click here
Browse Questions
0 votes

The need of Needleman-Wunsch and Smith-Waterman algorithm is

( A ) both use dynamic programming to find the best alignments, when the sequences are longer
( B ) to predict the homogeneity of databases
( C ) none
( D ) to predict differences in sequences
Can you answer this question?

Please log in or register to answer this question.

Related questions

Ask Question
student study plans
JEE MAIN, CBSE, NEET Mobile and Tablet App
The ultimate mobile app to help you crack your examinations
Get the Android App