演講摘要：
Given a set S={S1, S2, …, Sp} of p strings, a text T, and a natural number k, find a string M, which is a concatenation of k strings (not necessarily distinct) from S, whose longest common subsequence with T is longest. Such a string is called a k-inlay. The resequencing longest common subsequence problem is to find a k-inlay for each query with parameter k after T and S are given. In this talk, we introduce an efficient algorithm for solving this problem.