Fpatrick Healy

Learn More
In this paper we consider the problems of testing a multi-level graph for planarity and laying out or, drawing, a multi-level graph in a clear way. Our approach is based on integer linear programming. We introduce a new abstraction of a common integer linear programming formulation of the problems that we call a vertex-exchange graph. We demonstrate how(More)
We have previously found that a Tyr residue was critical for the interaction of peptides with the Kd molecule, and therefore may be acting as an anchor residue. In the present report we show that it is possible to convert a self peptide sequence into a Kd-restricted neo-antigen by a single Tyr substitution at position 2 of the peptide. This supports the(More)
  • 1