liveBook · Manning

Chapter 11: Graph Neural Networks for Predicting Drug-Target Affinity

What you will learn in chapter 11 of Build AI Drug Discovery Pipelines

The chapter introduction explains why graph representations may improve drug-target affinity prediction and motivates extending GraphDTA from a drug-graph model to a dual-graph design.

After this chapter you will be able to

What it builds on

Section by section

Introduction

The chapter introduction explains why graph representations may improve drug-target affinity prediction and motivates extending GraphDTA from a drug-graph model to a dual-graph design.

Key terms: SMILES, molecular graphs, topological and structural information, binding affinity, drug-target pairs, experimental testing, GraphDTA, GNN, 1D CNN, dual-graph

11.1 Challenges of Drug-Target Affinity Prediction

This section explains why drug-target affinity prediction matters in virtual screening, why sequence-based methods are needed, and why predicting binding strength is more informative than predicting binding alone.

Key terms: Drug-Target Affinity (DTA) prediction, binary classification, regression, dissociation constant (Kd), inhibition constant (Ki), 50% inhibitory concentration (IC50), structure-based virtual screening, 3D structural information, amino acid sequence, sequence-based virtual screening

11.1.1 Benchmarking Drug-Target Affinity

This section compares the DAVIS and KIBA affinity benchmarks and explains how their measurements, distributions, and coverage affect drug–target affinity modeling and evaluation.

Key terms: DAVIS, kinase selectivity, Kd, pKd, non-binder, MSE, Concordance Index (CI), KIBA, Ki, IC50

11.1.2 Necessity for Better Molecular and Protein Representations

This section explains why drug-target affinity prediction needs useful representations of both molecules and proteins, and why graphs can make molecular connectivity explicit.

Key terms: embeddings, concatenating, SMILES, Graph Neural Networks, nodes, edges, connectivity, 1D sequence, 3D shape, non-bonded interactions

11.2 Molecular Graph Construction

Introduces the graph structure and feature attributes used to represent chemical and biological entities for GNNs.

Key terms: graph, vertices, nodes, edges, node features, edge features

11.2.1 Small Molecules as Molecular Graphs

The section explains how small molecules become graphs, how those graphs can be stored, and why node and edge features add useful chemical information.

Key terms: nodes, edges, topology, molecular graph, adjacency matrix, edge list, sparse graphs, feature vector, attributed graph, edge features

11.2.2 From SMILES to Molecular Graphs

This section shows how to turn a SMILES string into a molecular graph with atom features and edges for a graph-level binding prediction task.

Key terms: SMILES, depth-first traversal, branches, ring closures, RDKit, edge list, reverse edge, self-loops, atomic feature representation, multi-hot vector

11.3 Proteins as Residue Interaction Graphs

The section explains how to represent proteins as residue-level graphs that preserve spatial contacts, and introduces the structural data and alignment preprocessing needed to build them.

Key terms: amino acid residue, node, coarse-grained, primary structure, spatial proximity, contact map, distance cutoff, alpha-carbons (Cα), GraphDTA, dual-GNN

11.3.1 Contact Maps as Structure Representation

This section explains how contact maps represent a protein’s spatial structure as a graph, including how predicted contacts are obtained from sequence and converted into graph edges.

Key terms: contact map, adjacency matrix, residues, rotation and translation invariant, homologous proteins, multiple sequence alignment (MSA), evolutionary coupling, compensatory mutations, Pconsc4, U-Net

11.3.2 Amino Acid Features and Position-Specific Scoring Matrices

Explains how biochemical properties and evolutionary sequence information become residue-level features for a protein graph.

Key terms: biochemical properties, binary indicators, continuous properties, normalization, position-specific scoring matrix, PSSM, multiple sequence alignment, conservation, position frequency matrix, PFM

11.4 Graph Neural Network Foundations

This section explains how graph neural networks turn molecular and protein graphs into fixed-size representations for drug-target affinity prediction.

Key terms: message passing, node features, neighbor, aggregation, permutation invariant, sum, mean, readout, PyTorch Geometric, edge_index

11.5 DualGraphDTA’s Dual-Stream Architecture

Introduces a dual-stream GNN that uses drug and protein graphs to predict binding affinity.

Key terms: dual-stream Graph Neural Network, GNN encoders, embedding, binding affinity

11.5.1 The Overall Architecture

This section explains how DualGraphDTA turns separate drug and protein graphs into a binding-affinity prediction, and why it uses two encoder streams.

Key terms: GNN encoder streams, node embeddings, global pooling, graph embedding, concatenation, MLP, dual-stream architecture, modalities, molecular graphs, protein processing stream

11.5.2 Architectural Components and Information Flow

This section traces how DualGraphDTA’s molecule and protein graph branches turn node features into compact embeddings using GCN layers, pooling, and fully connected layers.

Key terms: molecular graph processing branch, protein graph processing branch, GCN layers, global mean pooling, batch vector, graph-level representation, fully connected layers, bottleneck, 128-dimensional embedding, ReLU

11.5.3 Embedding Fusion and Prediction

This section explains how DualGraphDTA combines drug and protein representations, contrasts late fusion with direct interaction modeling, and turns the combined embedding into a binding-affinity prediction.

Key terms: concatenation, mol_embedding, prot_embedding, fusion, interaction graph, interaction edges, binding interface, pooling, hourglass architecture, fully connected layers

11.5.4 Alternative Architectures: GAT and GIN

Compares GAT and GIN with the chapter’s GCN model, explaining how they aggregate graph-neighbor information and why greater expressiveness did not necessarily improve drug-target affinity predictions.

Key terms: GAT, attention mechanism, GATConv, multi-head attention, heads, concat, GIN, GINConv, sum aggregation, ε

11.5.5 Graph Data Preparation & Abstraction with PyTorch Geometric

This section explains how to store and batch drug and protein graphs for affinity prediction, and why dataset coverage affects evaluation.

Key terms: warm start, cold-drug split, cold-target split, cold-drug/cold-target split, Data, x, edge_index, COO, y, Batch.from_data_list

11.5.6 Loss Function and Optimization

This section explains the loss, optimization, regularization, and validation choices used to train the drug-target affinity model.

Key terms: Mean Squared Error (MSE), regression, pKd, Adam optimizer, learning rate, dropout, fully connected layers, GCN layers, parameter sharing, translation invariance

11.6 Evaluating Drug-Target Interaction Models

This section explains why training dual-graph drug-target affinity models is expensive, motivating the expedited evaluations that follow.

Key terms: dual-graph neural network, epoch, training pairs, protein graphs, forward and backward passes

11.6.1 Performance Comparison of GCN, GAT, and GIN

This section explains how the concordance index evaluates affinity rankings and uses it to compare GCN, GAT, and GIN across DAVIS and KIBA training runs.

Key terms: Concordance Index (CI), concordant pairs, tied pairs, comparable pairs, MSE, differentiable surrogate, ranking metrics, GIN, GAT, GCN

11.6.2 Evaluating Pretrained Checkpoints

This section interprets DGraphDTA’s pretrained-checkpoint results, explains what its evaluation metrics mean for drug discovery, and identifies a limitation of aggregate scores.

Key terms: MSE, RMSE, pKd, Kd, DAVIS, KIBA, Pearson correlation, CI, binding affinity, virtual screening

11.7 Real-World Applications & Moving Beyond Topology

This section explains how graph-based drug–target models can guide discovery work and why researchers are exploring representations beyond 2D topology.

Key terms: virtual screening, experimental validation, molecular optimization, binding affinity, polypharmacology, off-target interactions, target validation, drug repurposing, 2D topological view, multi-modal learning

11.8 Summary

Where this is used later

Concepts explained in this chapter

← Chapter 10: Generative Models for De Novo Design Chapter 12: Transformers for Protein Structure Prediction →

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.