On the Space Complexity of Some Algorithms for Sequence Comparison
暂无分享，去创建一个
Recent algorithms for computing the modified edit distance given convex or concave gap cost functions are shown to require Ω(n2) space for certain input.
[1] E. Myers,et al. Sequence comparison with concave weighting functions. , 1988, Bulletin of mathematical biology.
[2] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.
[3] Raffaele Giancarlo,et al. Speeding up Dynamic Programming with Applications to Molecular Biology , 1989, Theor. Comput. Sci..