Figure 3
From: Automatic classification of protein structures relying on similarities between alignments
Modification of the graph G . Evolution of the size (top) and the number (bottom) of independent connex components (ICCs) of the modified graph G T for increasing threshold of ternary similarity T. (top) Higher is the threshold more stringent is the constraint and higher is the number of deleted edges from original graph of pair similarities G. (bottom) As a direct consequence, graph G T becomes more and more sparse, and connected components more numerous.