Figure 7From: A new, fast algorithm for detecting protein coevolution using maximum compatible cliquesStep 3. Vertices ahead of v j in the sorted neighbour list are found whose edges to both v i and v j are forward-compatible with e min (solid edges). These vertices, shown in grey with a check beside them, form the vertex set of the subgraph H. Vertices in the sorted list which fail this test, due to the presence of one or more non-forward-compatible edges (dashed) are indicated with an X. Vertices to the right of the sorted list automatically fail the test - their edges to v i have RPDs greater than R(e min )·δ and therefore are not compatible with e min due to the sorting of RPDs performed earlier.Back to article page