# Direct coupling analysis

Direct coupling analysis or DCA is an umbrella term comprising several methods for analyzing sequence data in computational biology.[1] The common idea of these methods is to use statistical modeling to quantify the strength of the direct relationship between two positions of a biological sequence, excluding effects from other positions. This contrasts usual measures of correlation, which can be large even if there is no direct relationship between the positions (hence the name direct coupling analysis). Such a direct relationship can for example be the evolutionary pressure for two positions to maintain mutual compatibility in the biomolecular structure of the sequence, leading to molecular coevolution between the two positions. DCA has been used in the inference of protein residue contacts,[1][2][3][4] RNA structure prediction,[5][6] the inference of protein-protein interaction networks[7][8] [9] and the modeling of fitness landscapes.[10][11][12]

## Mathematical Model and Inference

### Mathematical Model

The basis of DCA is a statistical model for the variability within a set of phylogenetically related biological sequences. When fitted to a multiple sequence alignment (MSA) of sequences of length ${\displaystyle N}$, the model defines a probability for all possible sequences of the same length.[1] This probability can be interpreted as the probability that the sequence in question belongs to the same class of sequences as the ones in the MSA, for example the class of all protein sequences belonging to a specific protein family.

We denote a sequence by ${\displaystyle a=(a_{1},a_{2}..,a_{N})}$, with the ${\displaystyle a_{i}}$ being categorical variables representing the monomers of the sequence (if the sequences are for example aligned amino acid sequences of proteins of a protein family, the ${\displaystyle a_{i}}$ take as values any of the 20 standard amino acids). The probability of a sequence within a model is then defined as

{\displaystyle {\begin{aligned}P\left(a|J,h\right)={\frac {1}{Z}}\exp {\left(\sum \limits _{i=1}^{N-1}\sum \limits _{j=i+1}^{N}J_{ij}(a_{i},a_{j})+\sum \limits _{i=1}^{N}h_{i}(a_{i})\right)},\end{aligned}}}

where

• ${\displaystyle J,h}$ are sets of real numbers representing the parameters of the model (more below)
• ${\displaystyle Z}$ is a normalization constant (a real number) to ensure ${\displaystyle \sum \limits _{a}P(a|J,h)=1}$

The parameters ${\displaystyle h_{i}(a_{i})}$ depend on one position ${\displaystyle i}$ and the symbol ${\displaystyle a_{i}}$ at this position. They are usually called fields[1] and represent the propensity of symbol to be found at a certain position. The parameters ${\displaystyle J_{ij}(a_{i},a_{j})}$ depend on pairs of positions ${\displaystyle i,j}$ and the symbols ${\displaystyle a_{i},a_{j},}$ at these positions. They are usually called couplings[1] and represent an interaction, i.e. a term quantifying how compatible the symbols at both positions are with each other. The model is fully connected, so there are interactions between all pairs of positions. The model can be seen as a generalization of the Ising model, with spins not only taking two values, but any value from a given finite alphabet. In fact, when the size of the alphabet is 2, the model reduces to the Ising model. Since it is also reminiscent of the model of the same name, it is often called Potts Model.[13]

It should be noted that even knowing the probabilities of all sequences does not determine the parameters ${\displaystyle J,h}$ uniquely. For example, a simple transformation of the parameters

${\displaystyle J_{ij}(a,b)\rightarrow J_{ij}(a,b)+R_{ij}}$

for any set of real numbers ${\displaystyle R_{ij}}$ leaves the probabilities the same. The likelihood function is invariant under such transformations as well, so the data cannot be used to fix these degrees of freedom (although a prior on the parameters might do so[3]).

A convention often found in literature[3][14] is to fix these degrees of freedom such that the Frobenius norm of the coupling matrix

${\displaystyle F_{ij}={\sqrt {\sum \limits _{a,b}J_{ij}(a,b)^{2}}},}$

is minimized (independently for every pair of positions ${\displaystyle i}$ and ${\displaystyle j}$).

### Maximum Entropy Derivation

To justify the Potts model, it is often noted that it can be derived following a maximum entropy principle:[15] For a given set of sample covariances and frequencies, the Potts model represents the distribution with the maximal Shannon entropy of all distributions reproducing those covariances and frequencies. For a multiple sequence alignment, the sample covariances are defined as

${\displaystyle C_{ij}(a,b)=f_{ij}(a,b)-f_{i}(a)f_{j}(b)}$,

where ${\displaystyle f_{ij}(a,b)}$ is the frequency of finding symbols ${\displaystyle a}$ and ${\displaystyle b}$ at positions ${\displaystyle i}$ and ${\displaystyle j}$ in the same sequence in the MSA, and ${\displaystyle f_{i}(a)}$ the frequency of finding symbol ${\displaystyle a}$ at position ${\displaystyle i}$. The Potts model is then the unique distribution ${\displaystyle P}$ that maximizes the functional

{\displaystyle {\begin{aligned}F[P]=&-\sum \limits _{a}P(a)\log P(a)\\&+\sum \limits _{i

The first term in the functional is the Shannon entropy of the distribution. The ${\displaystyle \lambda }$ are Lagrange multipliers to ensure ${\displaystyle P_{ij}(x,y)=f_{ij}(x,y)}$, with ${\displaystyle P_{ij}(x,y)}$ being the marginal probability to find symbols ${\displaystyle x,y}$ at positions ${\displaystyle i,j}$. The Lagrange multiplier ${\displaystyle \Omega }$ ensures normalization. Maximizing this functional and identifying

{\displaystyle {\begin{aligned}&\lambda _{ij}(x,y)=J_{ij}(x,y)\\&\lambda _{i}(x)=h_{i}(x)\\&\Omega =Z\\\end{aligned}}}

leads to the Potts model above. It should be noted that this procedure only gives the functional form of the Potts model, while the numerical values of the Lagrange multipliers (identified with the parameters) still have to be determined by fitting the model to the data.

### Direct Couplings and Indirect Correlation

The central point of DCA is to interpret the ${\displaystyle J_{ij}}$ (which can be represented as a ${\displaystyle q\times q}$ matrix if there are ${\displaystyle q}$ possible symbols) as direct couplings. If two positions are under joint evolutionary pressure (for example to maintain a structural bond), one might expect these couplings to be large because only sequences with fitting pairs of symbols should have a significant probability. On the other hand, a large correlation between two positions does not necessarily mean that the couplings are large, since large couplings between e.g. positions ${\displaystyle i,j}$ and ${\displaystyle j,k}$ might lead to large correlations between positions ${\displaystyle i}$ and ${\displaystyle k}$, mediated by position ${\displaystyle j}$.[1] In fact, such indirect correlations have been implicated in the high false positive rate when inferring protein residue contacts using correlation measures like mutual information.[16]

### Inference

The inference of the Potts model on a multiple sequence alignment (MSA) using maximum likelihood estimation is usually computationally intractable, because one needs to calculate the normalization constant ${\displaystyle Z}$, which is for sequence length ${\displaystyle N}$ and ${\displaystyle q}$ possible symbols a sum of ${\displaystyle q^{N}}$ terms (which means for example for a small protein domain family with 30 positions ${\displaystyle 20^{30}}$ terms). Therefore, numerous approximations and alternatives have been developed:

All of these methods lead to some form of estimate for the set of parameters ${\displaystyle J,{h}}$ maximizing the likelihood of the MSA. Many of them include regularization or prior terms to ensure a well-posed problem or promote a sparse solution.

## Applications

### Protein Residue Contact Prediction

A possible interpretation of large values of couplings in a model fitted to a MSA of a protein family is the existence of conserved contacts between positions (residues) in the family. Such a contact can lead to molecular coevolution, since a mutation in one of the two residues, without a compensating mutation in the other residue, is likely to disrupt protein structure and negatively affect the fitness of the protein. Residue pairs for which there is a strong selective pressure to maintain mutual compatibility are therefore expected to mutate together or not at all. This idea (which was known in literature long before the conception of DCA[19]) has been used to predict protein contact maps, for example analyzing the mutual information between protein residues.

Within the framework of DCA, a score for the strength of the direct interaction between a pair of residues ${\displaystyle i,j}$ is often defined[3][14] using the Frobenius norm ${\displaystyle F_{ij}}$ of the corresponding coupling matrix ${\displaystyle J_{ij}}$ and applying an average product correction (APC):

${\displaystyle F_{ij}^{APC}=F_{ij}-{\frac {F_{i}F_{j}}{F}},}$

where ${\displaystyle F_{ij}}$ has been defined above and

{\displaystyle {\begin{aligned}&F_{i}={\frac {1}{N}}\sum \limits _{j\neq i}^{N}F_{ij}\\&F={\frac {1}{N^{2}-N}}\sum \limits _{i,j,i\neq j}^{N}F_{ij}\end{aligned}}}.

This correction term was first introduced for mutual information[20] and is used to remove biases of specific positions to produce large ${\displaystyle F_{ij}}$. Scores that are invariant under parameter transformations that do not affect the probabilities have also been used.[1] Sorting all residue pairs by this score results in a list in which the top of the list is strongly enriched in residue contacts when compared to the protein contact map of a homologous protein.[4] High-quality predictions of residue contacts are valuable as prior information in protein structure prediction.[4]

### Inference of protein-protein interaction

DCA can be used for detecting conserved interaction between protein families and for predicting which residue pairs form contacts in a protein complex.[7][8] Such predictions can be used when generating structural models for these complexes,[21] or when inferring protein-protein interaction networks made from more than two proteins.[8]

### Modeling of fitness landscapes

DCA can be used to model fitness landscapes and to predict the effect of a mutation in the amino acid sequence of a protein on its fitness.[10][11]

## References

1. Morcos, F.; Pagnani, A.; Lunt, B.; Bertolino, A.; Marks, D. S.; Sander, C.; Zecchina, R.; Onuchic, J. N.; Hwa, T.; Weigt, M. (21 November 2011). "Direct-coupling analysis of residue coevolution captures native contacts across many protein families". Proceedings of the National Academy of Sciences. 108 (49): E1293–E1301. arXiv:1110.5223. Bibcode:2011PNAS..108E1293M. doi:10.1073/pnas.1111471108. PMC 3241805. PMID 22106262.
2. ^ Kamisetty, H.; Ovchinnikov, S.; Baker, D. (5 September 2013). "Assessing the utility of coevolution-based residue-residue contact predictions in a sequence- and structure-rich era". Proceedings of the National Academy of Sciences. 110 (39): 15674–15679. Bibcode:2013PNAS..11015674K. doi:10.1073/pnas.1314045110. PMC 3785744. PMID 24009338.
3. Ekeberg, Magnus; Lövkvist, Cecilia; Lan, Yueheng; Weigt, Martin; Aurell, Erik (11 January 2013). "Improved contact prediction in proteins: Using pseudolikelihoods to infer Potts models". Physical Review E. 87 (1): 012707. arXiv:1211.1281. Bibcode:2013PhRvE..87a2707E. doi:10.1103/PhysRevE.87.012707. PMID 23410359.
4. ^ a b c Marks, Debora S.; Colwell, Lucy J.; Sheridan, Robert; Hopf, Thomas A.; Pagnani, Andrea; Zecchina, Riccardo; Sander, Chris; Sali, Andrej (7 December 2011). "Protein 3D Structure Computed from Evolutionary Sequence Variation". PLoS ONE. 6 (12): e28766. Bibcode:2011PLoSO...628766M. doi:10.1371/journal.pone.0028766. PMC 3233603. PMID 22163331.
5. ^ De Leonardis, Eleonora; Lutz, Benjamin; Ratz, Sebastian; Cocco, Simona; Monasson, Rémi; Schug, Alexander; Weigt, Martin (29 September 2015). "Direct-Coupling Analysis of nucleotide coevolution facilitates RNA secondary and tertiary structure prediction". Nucleic Acids Research. 43 (21): 10444–55. doi:10.1093/nar/gkv932. PMC 4666395. PMID 26420827.
6. ^ Weinreb, Caleb; Riesselman, Adam J.; Ingraham, John B.; Gross, Torsten; Sander, Chris; Marks, Debora S. (May 2016). "3D RNA and Functional Interactions from Evolutionary Couplings". Cell. 165 (4): 963–975. doi:10.1016/j.cell.2016.03.030. PMC 5024353. PMID 27087444.
7. ^ a b Ovchinnikov, Sergey; Kamisetty, Hetunandan; Baker, David (1 May 2014). "Robust and accurate prediction of residue–residue interactions across protein interfaces using evolutionary information". eLife. 3: e02030. doi:10.7554/eLife.02030. PMC 4034769. PMID 24842992.
8. ^ a b c Feinauer, Christoph; Szurmant, Hendrik; Weigt, Martin; Pagnani, Andrea; Keskin, Ozlem (16 February 2016). "Inter-Protein Sequence Co-Evolution Predicts Known Physical Interactions in Bacterial Ribosomes and the Trp Operon". PLOS ONE. 11 (2): e0149166. arXiv:1512.05420. Bibcode:2016PLoSO..1149166F. doi:10.1371/journal.pone.0149166. PMC 4755613. PMID 26882169.
9. ^ dos Santos, R.N.; Morcos, F.; Jana, B.; Andricopulo, A.D.; Onuchic, J.N. (4 September 2015). "Dimeric interactions and complex formation using direct coevolutionary couplings". Scientific Reports. 5: 13652. doi:10.1038/srep13652. PMC 4559900. PMID 26338201.
10. ^ a b Ferguson, Andrew L.; Mann, Jaclyn K.; Omarjee, Saleha; Ndung'u, Thumbi; Walker, Bruce D.; Chakraborty, Arup K. (March 2013). "Translating HIV Sequences into Quantitative Fitness Landscapes Predicts Viral Vulnerabilities for Rational Immunogen Design". Immunity. 38 (3): 606–617. doi:10.1016/j.immuni.2012.11.022. PMC 3728823. PMID 23521886.
11. ^ a b Figliuzzi, Matteo; Jacquier, Hervé; Schug, Alexander; Tenaillon, Oliver; Weigt, Martin (January 2016). "Coevolutionary Landscape Inference and the Context-Dependence of Mutations in Beta-Lactamase TEM-1". Molecular Biology and Evolution. 33 (1): 268–280. doi:10.1093/molbev/msv211. PMC 4693977. PMID 26446903.
12. ^ Asti, Lorenzo; Uguzzoni, Guido; Marcatili, Paolo; Pagnani, Andrea; Ofran, Yanay (13 April 2016). "Maximum-Entropy Models of Sequenced Immune Repertoires Predict Antigen-Antibody Affinity". PLOS Computational Biology. 12 (4): e1004870. Bibcode:2016PLSCB..12E4870A. doi:10.1371/journal.pcbi.1004870. PMC 4830580. PMID 27074145.
13. ^ Feinauer, Christoph; Skwark, Marcin J.; Pagnani, Andrea; Aurell, Erik (9 October 2014). "Improving Contact Prediction along Three Dimensions". PLoS Computational Biology. 10 (10): e1003847. arXiv:1403.0379. Bibcode:2014PLSCB..10E3847F. doi:10.1371/journal.pcbi.1003847. PMC 4191875. PMID 25299132.
14. ^ a b c Baldassi, Carlo; Zamparo, Marco; Feinauer, Christoph; Procaccini, Andrea; Zecchina, Riccardo; Weigt, Martin; Pagnani, Andrea; Hamacher, Kay (24 March 2014). "Fast and Accurate Multivariate Gaussian Modeling of Protein Families: Predicting Residue Contacts and Protein-Interaction Partners". PLoS ONE. 9 (3): e92721. arXiv:1404.1240. Bibcode:2014PLoSO...992721B. doi:10.1371/journal.pone.0092721. PMC 3963956. PMID 24663061.
15. ^ Stein, Richard R.; Marks, Debora S.; Sander, Chris; Chen, Shi-Jie (30 July 2015). "Inferring Pairwise Interactions from Biological Data Using Maximum-Entropy Probability Models". PLOS Computational Biology. 11 (7): e1004182. Bibcode:2015PLSCB..11E4182S. doi:10.1371/journal.pcbi.1004182. PMC 4520494. PMID 26225866.
16. ^ Burger, Lukas; van Nimwegen, Erik; Bourne, Philip E. (1 January 2010). "Disentangling Direct from Indirect Co-Evolution of Residues in Protein Alignments". PLoS Computational Biology. 6 (1): e1000633. Bibcode:2010PLSCB...6E0633B. doi:10.1371/journal.pcbi.1000633. PMC 2793430. PMID 20052271.
17. ^ Weigt, M.; White, R. A.; Szurmant, H.; Hoch, J. A.; Hwa, T. (30 December 2008). "Identification of direct residue contacts in protein-protein interaction by message passing". Proceedings of the National Academy of Sciences. 106 (1): 67–72. arXiv:0901.1248. Bibcode:2009PNAS..106...67W. doi:10.1073/pnas.0805923106. PMC 2629192. PMID 19116270.
18. ^ Barton, J. P.; De Leonardis, E.; Coucke, A.; Cocco, S. (21 June 2016). "ACE: adaptive cluster expansion for maximum entropy graphical model inference". Bioinformatics. 32 (20): 3089–3097. doi:10.1093/bioinformatics/btw328. PMID 27329863.
19. ^ Göbel, Ulrike; Sander, Chris; Schneider, Reinhard; Valencia, Alfonso (April 1994). "Correlated mutations and residue contacts in proteins". Proteins: Structure, Function, and Genetics. 18 (4): 309–317. doi:10.1002/prot.340180402. PMID 8208723.
20. ^ Dunn, S.D.; Wahl, L.M.; Gloor, G.B. (5 December 2007). "Mutual information without the influence of phylogeny or entropy dramatically improves residue contact prediction". Bioinformatics. 24 (3): 333–340. doi:10.1093/bioinformatics/btm604. PMID 18057019.
21. ^ Schug, A.; Weigt, M.; Onuchic, J. N.; Hwa, T.; Szurmant, H. (17 December 2009). "High-resolution protein complexes from integrating genomic information with molecular simulation". Proceedings of the National Academy of Sciences. 106 (52): 22124–22129. Bibcode:2009PNAS..10622124S. doi:10.1073/pnas.0912100106. PMC 2799721. PMID 20018738.