Uri Laserson organized a delightful class at Mount Sinai called Applications of DNA Sequencing and Synthesis to Immunology. It was a survey of several related emerging trends in genomics and immunology with each week was structured around a pair of papers presented by students. For the first week, I presented Identifying specificity groups in the T cell receptor repertoire (a.k.a. "the GLIPH paper") by Jake Glanville, Mark Davis (and many other people).
The basic gist of GLIPH (Grouping of Lymphocyte Interactions by Paratope Hotspots) is that since TCRs with similar antigen specificity have been observed to have similar CDR3 sequences then clustering TCRs in the space of amino acid sequences will also effectively cluster them by specificity. The GLIPH algorithm links two TCRs into a cluster by either of the following heuristics:
In addition to these linkage criteria, GLIPH also uses a variety of features to score the quality/purity of each cluster. The complete algorithm schematic is given in Extended Data Figure 3:
One of the main evaluations of GLIPH is summarized in Extended Data Figure 4c:
Data: The authors created a dataset of TCRs with known antigen specificity by collecting blood samples from 33 healthy donors and sorting their T-cells using 8 pMHC tetramers containing known immunodominant epitopes from CMV, EBV and flu. The sequenced TCRs of these antigen specific T-cells can then be used as inputs to any clustering approach and the specificity labels can be used to evaluate the purity of generated clusters.
Sensitivity vs. Purity: In the above figure, each dot represents a different clustering algorithm. The X-axis is the sensitivity of the clustering (what fraction of TCRs are assigned to clusters) and Y-axis is the average purity of each cluster (where 100% means that any linked TCRs always share antigen specificity). The two linkage criteria used by GLIPH are "local +struct" and "global dist=1". The label "+struct" just means that the comparison of k-mers occurs only in the CDR3 region of the TCR, rather than the whole sequence. As you can see, both of these clustering rules perform almost as well as the GLIPH algorithm itself.
Pruning after clustering? I think GLIPH performs some kind of filtering on low quality clusters which was either unstated or I simply missed in my reading of the paper). If we were to simply link TCRs which satisfy either one of the independent "local +struct" and "global dist=1" criteria we would expect to see an increase on the X-axis to at least the ~15% achieved by "global dist=1" clustering and likely to an even higher sensitivity (20% or beyond). This sensitivity would most likely be accompanied by a decrease in cluster purity, due to spurious TCR linkages. To achieve a lower sensitivity and higher cluster purity requires the elimination of some cluster linkages. Maybe this final pruning step is obvious from the source code but reading Perl has never come easily to me.
Broader applications? Since all of the approaches discussed in the GLIPH paper are different approaches to unsupervised clustering, they rely on generating relatively "pure" clusters for reasoning about the specificity of TCRs with unknown function. While the linkage method presented might achieve tolerable cluster purities when the labels are restricted to 8 known epitopes, I wonder how well this approach scales in the presence of additional labels. If a high throughput tetramer assay were used to identify TCR specificities across hundreds or thousands of epitopes, would all the clusters be hopelessly impure?
We just sent you an email. Please click the link in the email to confirm your subscription!