HuntMcIlroy algorithm

#	Item
1	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 07974 Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2013-02-15 00:09:52 Mathematics Dynamic programming Combinatorics Discrete mathematics Formal languages Data differencing HuntMcIlroy algorithm Longest increasing subsequence Longest common subsequence problem Subsequence Diff utility Data comparison
2	A = a x aa m if and only if there is a mapping F: {1, 2, . . . , p} ~ {1, 2, . . . , m} such that f(i) = k only if c~ is ak and F is a m o n o t o n e strictly increasing function (i.e. F(i) = u, F ( j ) = v, a Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Dynamic programming Combinatorics Subsequence Longest common subsequence problem Longest increasing subsequence HuntMcIlroy algorithm