User: shreya.verma808

Reputation:
10
Status:
New User
Location:
Last seen:
6 months, 1 week ago
Joined:
6 months, 1 week ago
Email:
s**************@gmail.com

Posts by shreya.verma808

<prev • 1 results • page 1 of 1 • next >
4
votes
1
answer
335
views
1
answer
Question related to time complexity of Needleman-Wunsch Algorithm
... 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? ...
alignment written 6 months ago by shreya.verma80810 • updated 6 months ago by Rob4.5k

Latest awards to shreya.verma808

No awards yet. Soon to come :-)

Help
Access

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.
Powered by Biostar version 2.3.0
Traffic: 970 users visited in the last hour