A fast algorithm for computing longest common subsequences
暂无分享,去创建一个
[1] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[2] Frank H. Benner. On designing generalized file records for management information systems , 1899, AFIPS '67 (Fall).
[3] Michael L. Fredman,et al. On computing the length of longest increasing subsequences , 1975, Discret. Math..
[4] Peter van Emde Boas,et al. Preserving order in a forest in less than logarithmic time , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[5] D. Knuth,et al. Selected combinatorial research problems. , 1972 .
[6] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.
[7] Jack E. Shemer,et al. Analysis of retrieval performance for selected file organization techniques , 1970, AFIPS '70 (Fall).