140 likes | 143 Views
Space-Saving Strategies for Analyzing Biomolecular Sequences. Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan URL: http://www.csie.ntu.edu.tw/~kmchao. Linear-space ideas Hirschberg, 1975; Myers and Miller, 1988.
E N D
Space-Saving Strategies for Analyzing Biomolecular Sequences Kun-Mao Chao (趙坤茂) Department of Computer Science and Information Engineering National Taiwan University, Taiwan URL: http://www.csie.ntu.edu.tw/~kmchao
Linear-space ideasHirschberg, 1975; Myers and Miller, 1988 Partition line m/2
Two subproblems½ original problem size m/4 m/2 3m/4
Four subproblems¼ original problem size m/4 m/2 3m/4
Time and Space Complexity • Space: O(M+N) • Time:O(MN)*(1+ ½ + ¼ + …) = O(MN) 2
Band Alignment(Joint work with W. Pearson and W. Miller) SequenceA SequenceB
Band Alignment in Linear Space The remaining subproblems are no longer only half of the original problem. In worst case, this could cause an additional log N factor in time. O(log N) O(NW)*(1+1+…+1) =O(NW log N)
Yet another partition line Band width W