Date: 2013-02-15 00:09:52Mathematics Dynamic programming Combinatorics Discrete mathematics Formal languages Data differencing HuntMcIlroy algorithm Longest increasing subsequence Longest common subsequence problem Subsequence Diff utility Data comparison | | An Algorithm for Differential File Comparison J. W. Hunt Department of Electrical Engineering, Stanford University, Stanford, California M. D. McIlroy Bell Laboratories, Murray Hill, New Jersey 07974Add to Reading ListSource URL: www.cs.dartmouth.eduDownload Document from Source Website File Size: 36,99 KBShare Document on Facebook
|