Figure 4
From: A new, fast algorithm for detecting protein coevolution using maximum compatible cliques
Example compatibility graph. Example compatibility graph for two protein families A = {a1 ... a6} and B = {b1 ... b5}. Circles are vertices representing an a i to b j protein pair from matching species. The grey vertices are pairs that will form a match of size 5 if all 10 connecting edges (also in grey) are compatible with each other. Edges between vertices not included in the maximum clique are omitted for clarity.