Figure 2
From: Automatic classification of protein structures relying on similarities between alignments
Graph modification method. (a) the description of object parts, (b) the graph G of pair similarities, (c) the line graph L(G), (d) the graph P T with marked edges not fulfilling the constraint of ternary similarity represented in dashed gray, (e) the graph P T − E T =L( G T ), with vertices E T removed during the heuristic ℋ and their removed incident edges represented in dashed gray, (f) the graph G T fulfilling the ternary similarity.