Fig. 2.

Example of a string-of-beads traveling salesperson (TSP) graph. Solving a TSP yields the shortest round trip, which visits each node exactly once. To solve the epitope assembly problem, each epitope is assigned to a node and artificial start and end nodes, representing the N- and C-terminals of the SBV, are added to the graph. The edges are weighted by the negative cleavage likelihood ratios of the two adjacent epitopes and labeled with the corresponding spacer of the epitope pair. Red edges mark the optimal round trip leading to an SBV of KLLEEVLLL-HDH-ALADGVQKV-HH-SVASTTTGV