First Page | Document Content | |
---|---|---|
Date: 2014-11-28 11:05:21Dynamic programming Combinatorics Subsequence Longest common subsequence problem Longest increasing subsequence HuntMcIlroy algorithm | 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, aAdd to Reading ListSource URL: bioinfo.ict.ac.cnDownload Document from Source WebsiteFile Size: 245,68 KBShare Document on Facebook |