Search
Skip to Search Results
Filter
Subject / Keyword
Collections
Author / Creator / Contributor
Year
Languages
Item type
-
2001
Schaeffer, Jonathan, Charter, K., Lu, Paul, Szafron, Duane, Parsons, I., Driga, A.
Technical report TR01-10. For two DNA or protein sequences of length m and n, dynamic programming alignment algorithms like Needleman-Wunsch and Smith-Waterman take O(m x n) time and use O(m x n) space, so we refer to them as full matrix (FM) algorithms. This space requirement means that large...
1 - 1 of 1