Email
Chat with tutors
logo

Ask Questions, Get Answers

X
 
Answer
Comment
Share
Q)

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

Please log in or register to answer this question.

Home Ask Tuition Questions
Practice
Your payment for is successful.
Continue
...