Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3

First Page		Document Content
Date: 2008-03-23 11:43:26 Computational complexity theory Mathematics Dynamic programming Theory of computation IP Longest common subsequence problem		Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3 Add to Reading List Source URL: cgi.csc.liv.ac.uk Download Document from Source Website File Size: 152,04 KB Share Document on Facebook

	Noisy FAQ Retrieval Using Longest Common Subsequence Problem Pooja Porwal Aman Jain DocID: 1rVQe - View Document
	Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3 DocID: 1rszu - View Document
	1 Exemplar Longest Common Subsequence Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin , Raffaella Rizzi and St´ephane Vialette DocID: 1qY8g - View Document
	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 DocID: 1qHmz - View Document
	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 DocID: 1pdWs - View Document