A protein graph represents amino acid residues as nodes and spatial contacts as edges. A contact map supplies its adjacency matrix: entry C[i,j] is 1 when residues are sufficiently close. section 11.3.1
Construct the representation by:
- Computing an L×L contact map for a protein sequence of length L. section 11.3.1
- Defining contact with an 8 Å distance threshold between C-beta atoms, or C-alpha atoms for glycine. section 11.3.1
- Converting qualifying matrix entries into graph edges and adding sequence-derived residue features. section 11.3.1
From structure or sequence
A Python workflow loads a .npy contact map, checks that its dimensions match the target sequence, extracts edges using a configured threshold, and computes features from an alignment file. When structures are unavailable, deep-learning contact predictors can estimate maps from sequence information. section 11.3.1
