A2, Q1B
12 views
Skip to first unread message
Brian
Nov 17, 2010, 10:19:01 PM11/17/10
to csc2417-f10
Is it sufficient for full marks to find an algorithm that is O(k n log
n), given that a) this algorithm is an heuristic and b) for a multiple
sequence alignment, k << n is a requisite for an informative
resolution?
n), given that a) this algorithm is an heuristic and b) for a multiple
sequence alignment, k << n is a requisite for an informative
resolution?
Michael Brudno
Nov 18, 2010, 6:09:32 PM11/18/10
to csc24...@googlegroups.com
I am expecting a non-heirustic algorithm that is O(n^2). Anything more is bonus.
Reply all
Reply to author
Forward
0 new messages