Figure 4

Example of compatibility graph constructed with classical and new methods. The CG of pattern graph P 1 and peptide graph G 1 of Figure 1 constructed with (a) classical and (b) new CG building rules. Each CG node is identified by a letter. It represents an association between a node of P 1 and a node of G 1 with compatible labels. For example, node 'a' associates node 0 of P 1 and node 4 of G 1 that both carry the 'D-Tyr' label. Dashed edges correspond to the edges that differ between the two CGs and the bold edges correspond to a clique of size 5 (size of P 1).