Fig. 1

Graph-based segmentation of ADK into rigid domains. a Protein graph constructed from open and closed conformations. b Reduced graph obtained by coarse-graining the protein graph. c A line graph of the reduced graph. d A line graph with binary vertex labels (black: − 1, white: + 1) obtained with the generalized Viterbi algorithm. e The injective relation between edges of the reduced graph and vertices of the line graph allows us to also label the edges of the reduced graph. Edges having negative labels are removed resulting in three disconnected subgraphs. f A segmented protein graph derived from disconnected subgraphs in the reduced graph. g ADK graph with domain annotation from literature encoded by colors