Question: Question related to time complexity of Needleman-Wunsch Algorithm

1

shreya.verma808 •

**10**wrote:The time complexity of Needleman-Wunsch algorithm is O(m*n) for pairwise sequence alignment with one sequence of length m and another sequence of length n.For three sequence alignment with lenght m,n,k respectively then what is the time complexity?

ADD COMMENT
• link
•
modified 9 months ago
by
Rob ♦

**4.6k**• written 9 months ago by shreya.verma808 •**10**