In SW algorithm, to align two sequences of lengths of m and n _________ time is required.
In SW algorithm, to align two sequences of lengths of m and n _________ time is required. Correct Answer O(m2n)
The Smith–Waterman algorithm is quite demanding of time. Hence if two sequences of lengths of m and n have to be aligned, the required time is O(m2n). It requires O(mn) calculation steps.
মোঃ আরিফুল ইসলাম
Feb 20, 2025