Fig. 2
From: Efficient inference of homologs in large eukaryotic pan-proteomes
a An example of two intersecting proteins, P1 and P2, which share some hexamers. b The intersection graph is built from intersecting pairs of proteins. c The similarity graph consists of similarity components. Each bold edge represents a similarity score greater than the threshold (T). d Homology groups are detected in each similarity component by MCL