Needleman-Wunsch and Smith-Waterman Algorithms Quiz

Who were the creators of the Needleman-Wunsch algorithm?

• Smith and Waterman

• Saul B. Needleman and Christian D. Wunsch

• Alan Turing and Ada Lovelace

• John Doe and Jane Smith

In which year was the Smith-Waterman algorithm published?

• 1990

• 1981

• 1970

• 2000

How does the Needleman-Wunsch algorithm handle the initialization step?

• By leaving the matrix empty

• By filling the column and row with zeros

• By progressively adding gap penalties

• By using random values

What is the main difference in the traceback process between the two algorithms?

• Needleman-Wunsch starts at the highest value

• Smith-Waterman starts at the bottom right corner

• Needleman-Wunsch starts at the bottom right corner

• Smith-Waterman ends at the top left corner

What do both algorithms use to fill the matrix?

• Only negative values

• Random numbers

• Only positive values

• Match rewards and gap penalties