We give a TDI description for a class of polytopes which corresponds to a restricted 2-matching problem. The perfect matching polytope, triangle-free perfect 2-matching polytope and relaxations of the traveling salesman polytope are members of this class. For a class of restrictions G. Cornuéjols, D. Hartvigsen and W.R. Pulleyblank have shown that the unweighted problem is tractable; here we sh...

This paper is concerned with the performance of Orthogonal Matching Pursuit (OMP) algorithms applied to a dictionary D in a Hilbert space H. Given an element f ∈ H, OMP generates a sequence of approximations fn, n = 1, 2, . . ., each of which is a linear combination of n dictionary elements chosen by a greedy criterion. It is studied whether the approximations fn are in some sense comparable to...

We shall show that if the restricted isometry constant (RIC) δs+1(A) of the measurement matrix A satisfies δs+1(A) < 1 √ s+ 1 , then the greedy algorithm Orthogonal Matching Pursuit(OMP) will succeed. That is, OMP can recover every s-sparse signal x in s iterations from b = Ax. Moreover, we shall show the upper bound of RIC is sharp in the following sense. For any given s ∈ N, we shall construc...

We give a constructive proof for a min-max relation on restricted b-matchings in bipartite graphs, extending results of Hartvigsen [5, 6], Király [7], and Frank [3]. Restricted b-matching is a special case of covering pairs of sets, for which Benczúr and Végh [1, 2] constructed a polynomial time algorithm – this implies a polynomial time algorithm for restricted b-matchings, as well. In this pa...

Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and searching for approximate occurrences of A inside B. We consider the classic Levenshtein distance, but the discussion is applicable also to indel distance. A relatively new variant [8] of string matching, motivated in...

The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any ≥  , the matching preclusion numbers of both -dimensional restricted HL-graph and recursive circulant  ...

We have identified an HLA-A2-restricted CD8(+) T-cell epitope, FLYALALLL, in the Epstein-Barr virus (EBV) latent membrane protein 2 (LMP2), an important target antigen in the context of EBV-associated malignancies. This epitope is TAP independent, like other hydrophobic LMP2-derived epitopes, but uniquely is dependent upon the immunoproteasome for its generation.