Titlebook: Combinatorial Pattern Matching; 26th Annual Symposiu Ferdinando Cicalese,Ely Porat,Ugo Vaccaro Conference proceedings 2015 Springer Interna

Inscrutable

Parameterized Complexity of Superstring Problems,that such a parameterization does not admit a polynomial kernel up?to some complexity assumption. We also obtain several results about “below guaranteed values” parameterization of the problem. We show that parameterization by compression admits a polynomial kernel while parameterization “below matching” is hard.

浮夸

installment

Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem, is known that this problem can be solved in . time. In this paper, we first propose an .-time algorithm for the problem based on interesting properties of boxed subsequences. Then, we give a further improved algorithm which runs in . time using preprocessed information on . and order-statistics trees.

DEAF

MAL

暫時(shí)別動(dòng)

有節(jié)制

https://doi.org/10.1007/978-3-319-94523-1how that the problem is .-hard. In addition we consider restricted versions of the problem where a node can only participate in a bounded number of swaps. We show that the problem is .-hard under these restrictions as well.

結(jié)合

meretricious

TEN