L EARNING PROTEIN SEQUENCE EMBEDDINGS USING INFORMATION FROM STRUCTURE
Anonymous authors
Paper under double-blind review
A BSTRACT
Inferring the structural properties of a protein from its amino acid sequence is a challenging yet important problem in biology.
Structures are not known for the vast majority of protein sequences, but structure is critical for understanding function. Existing approaches for detecting structural similarity between proteins from sequence are unable to recognize and exploit structural patterns when sequences have diverged too far, limiting our ability to transfer knowledge between structurally related proteins. We newly approach this problem through the lens of representation learning.
We introduce a framework that maps any protein sequence to a sequence of vector embeddings — one per amino acid position — that encode structural information.
We train bidirectional long short-term memory (LSTM) models on protein sequences with a two-part feedback mechanism that incorporates information from (i) global structural similarity between proteins and (ii) pairwise residue contact maps for individual proteins.
To enable learning from structural similarity information, we deﬁne a novel similarity measure between arbitrarylength sequences of vector embeddings based on a soft symmetric alignment (SSA) between them.
Our method is able to learn useful position-speciﬁc embeddings despite lacking direct observations of position-level correspondence between sequences. We show empirically that our multi-task framework outperforms other sequence-based methods and even a top-performing structure-based alignment method when predicting structural similarity, our goal.
Finally, we demonstrate that our learned embeddings can be transferred to other protein sequence problems, improving the state-of-the-art in transmembrane domain prediction.
I NTRODUCTION
Proteins are linear chains of amino acid residues that fold into speciﬁc 3D conformations as a result of the physical properties of the amino acid sequence.
These structures, in turn, determine the wide array of protein functions, from binding speciﬁcity to catalytic activity to localization within the cell.
Information about structure is vital for studying the mechanisms of these molecular machines in health and disease, and for development of new therapeutics.
However, experimental structure determination is costly and atomic structures have only been determined for a tiny fraction of known proteins.
Methods for ﬁnding proteins with related structure directly from sequence are of considerable interest, but the problem is challenging, because sequence similarity and structural similarity are only loosely related [1, 2, 3, 4], e.g. similar structural folds can be formed by diverse sequences.
As a result, our ability to transfer knowledge between proteins with similar structures is limited.
In this work, we address this problem by learning protein sequence embeddings using weak supervision from global structural similarity for the ﬁrst time.
Speciﬁcally, we aim to learn a bidirectional LSTM (biLSTM) embedding model, mapping sequences of amino acids to sequences of vector representations, such that residues occurring in similar structural contexts will be close in embedding space. This is difﬁcult, because we have not observed position-level correspondences between sequences, only global sequence similarity.
We solve this by deﬁning a whole sequence similarity measure from sequences of vector embeddings. The measure decomposes into an alignment of the sequences and pairwise comparison of the aligned positions in embedding space.
For the alignment, we propose a soft symmetric alignment (SSA) mechanism — a symmetrization of the directional alignment commonly used in attention mechanisms.
Furthermore, in order to take advantage of information about local structural context within proteins, we extend this framework to include position-level supervision from contacts between residues in the individual protein structures.
This multitask framework (Figure 1) allows us to newly leverage both global structural similarity between proteins and residue-residue contacts within proteins for training embedding models.
We ﬁrst benchmark our model’s ability to correctly predict structural similarity between pairs of sequences using the SCOPe ASTRAL dataset [5].
This dataset contains protein domains manually classiﬁed into a hierarchy of structural categories (Appendix Figure 3). We show that our model dramatically outperforms other sequence-based protein comparison methods when predicting comembership in the SCOP hierarchy.
Remarkably, our model even outperforms TMalign [6], which requires structures as input and therefore structures must be known a priori . In contrast, our model uses only sequence as input. Next, we perform an ablation study to evaluate the importance of our modeling components for structural similarity prediction.
We also consider an additional task, secondary structure prediction, to assess the model’s ability to capture local structure features. We demonstrate that SSA outperforms alternative alignment methods for both of these tasks and that inclusion of the contact prediction training task further improves performance.
Finally, we demonstrate that the embeddings learned by our model are generally applicable to other protein machine learning problems by leveraging our embeddings to improve the state-of-the-art in transmembrane prediction.
This work presents the ﬁrst attempt in learning protein sequence embeddings from structure and takes a step towards bridging the sequence-structure divide with representation learning.
R ELATED W ORK
Current work in protein sequence embeddings has primarily been focused on unsupervised k-mer co-occurence approaches to learn ﬁxed sized vector representations [7, 8] based on similar methods in NLP [9, 10, 11, 12]. Melvin et al.
[13] also learn ﬁxed sized semantic embeddings by projecting alignment scores into a low dimensional vector to recapitulate rankings given by existing alignment tools and shared superfamily membership.
However, ﬁxed sized vector representations are limited, because they are not usable for any sequence labeling problems (e.g. active site prediction, transmembrane region prediction, etc.).
Other methods have focused on manual feature engineering based on biophysical and sequence attributes [14].
These methods rely on expert knowledge and do not capture properties that emerge from interactions between amino acids. Instead, we seek to learn embeddings that encode the full structural context in which each amino acid occurs.
This is inspired partly by the recent success of unsupervised contextual embedding models using bidirectional recurrent neural network language models [15, 16] where word embeddings, learned as a function of their context, have been successfully transferred to other tasks.
In particular, we apply a similar language model for the ﬁrst time on protein sequences as part of our supervised framework. Supervised embedding models have also been trained for natural language inference (NLI) but produce only ﬁxed sized embeddings [17, 18, 19]. At the same time, problems involving word alignment given matched sequences, such as cross lingual word embeddings and document similarity, have also been explored.
Cross lingual word embeddings are learned from unaligned parallel text, where sentences are matched between languages but words are not.
Koˇciský et al.
[20] learn bilingual word embeddings jointly with a FastAlign [21] word alignment model using expectation maximization.
BilBOWA [22] learns cross lingual word embeddings using parallel sentences without word level alignments by assuming a uniform alignment between words.
However, Gouws et al.
[22] assume all pairings between words are equally likely and do not infer them from current values of the embeddings. Related methods have been developed for measuring similarity between documents based on their words. Word Mover’s Distance (WMD) and its supervised variant align words between pairs of documents by solving an optimal transport problem given by distance between word vectors.
However, these methods are not designed for learning neural network embedding models and the embeddings are not contextual.
Furthermore, WMD alignments are prohibitively expensive when alignments must be computed at every optimization step, scaling as O ( p 3 log p ) where p is the number of unique words.
Our SSA solves these problems via an alignment mechanism inspired by previous work using soft alignments and attention mechanisms for sequence modeling [23, 24].
Further elaborate directional alignments have been used for question answering and reading comprehension models [25, 26, 27] and for natural language inference [28, 29, 29].
Unlike these methods, however, our SSA method is both symmetric and memoryless.
Furthermore, it is designed for learning interpretable embeddings based on a similarity measure between individual sequence elements. It is also fast and memory efﬁcient - scaling with the product of the sequence lengths.
Protein fold recognition is the problem of classifying proteins into folds (for example, as deﬁned by the SCOP database) based on their sequences.
Approaches to this problem have largely been based on sequence homology using sequence similarity to classify structures based on close sequence matches [5, 30].
These methods are either direct sequence alignment tools [31, 32] or based on proﬁle HMMs in which multiple sequence alignments are ﬁrst built by iterative search against a large sequence database, the multiple sequence alignments are converted into proﬁle HMMs, and then sequences are compared using HMM-sequence or HMM-HMM alignments [33, 34].
However, these methods are only appropriate for matching proteins with high sequence similarity [2, 3, 30].
In contrast, we focus on learning protein sequence representations that directly capture structure information in an easily transferable manner.
We hypothesize that this approach will improve our ability to detect structural similarity from sequence while also producing useful features for other learning tasks.
M ETHODS
In this section, we describe the three components of our framework (Figure 1) in detail: (1) the speciﬁc choice of embedding model, a multi-layer bidirectional LSTM with additional inputs from a pretrained LSTM language model, (2) soft symmetric alignment and ordinal regression components for relating sequences of vector representations for pairs of proteins to their global structural similarity, and (3) the pairwise feature vectors and convolutional neural network design for residue-residue contact prediction.
3. B I LSTM SEQUENCE ENCODER WITH PRETRAINED LANGUAGE MODEL
BiLSTM encoder. The encoder takes a sequence of amino acids representing a protein and encodes it into a sequence of vector representations of the same length.
To allow the vector representations at each position to be functions of all surrounding amino acids, we structure the encoder as a stack of bidirectional LSTMs followed by a linear layer projecting the outputs of the last biLSTM layer into the ﬁnal embedding space (Appendix Figure 2). Pretrained language model.
The concept of feeding LSTM language model representations as inputs for supervised learning problems as part of a larger neural network model has shown recent success in NLP but has not yet been tried for biological sequences. Inspired partially by the success of ELMo [16], we consider, in addition to 1-hot representations of the amino acids, the inclusion of the hidden layers of a pretrained bidirectional LSTM language model as inputs to the encoder described above. The language model is pretrained on the raw protein sequences in the protein families database (Pfam) [35] to predict the amino acid at each position of each protein given the previous amino acids and the following amino acids (see Appendix section A.1 for details). Speciﬁcally, given the language model hidden states at each position, i , denoted as h LMi , and the 1-hot representation of the amino acid at those positions, x i , we introduce a learned linear transformation of these representations with ReLU non-linearity,
[Equation]
which is passed as input to the biLSTM sequence encoder. The parameters W LM , W x , and b are trained together with the parameters of the biLSTM encoder.
The parameters of the language model itself are frozen during training.
In experiments without the language model, h LMi is set to zero for all positions.
3. P ROTEIN STRUCTURE COMPARISON
The primary task we consider for training the sequence embedding model with structural information is the prediction of global structural similarity between protein sequences as deﬁned by shared membership in the SCOP hierarchy. SCOP is an expertly curated database of protein domain structures in which protein domains are assigned into a hierarchy of structures (Appendix Figure 3).
Speciﬁcally, we deﬁne this as a multiclass classiﬁcation problem in which a pair of proteins is classiﬁed into no similarity, class level similarity, fold level similarity, superfamily level similarity, or family level similarity based on the most speciﬁc level of the SCOP hierarchy shared by those proteins. We encode these labels as y ∈ { 0 , 1 , 2 , 3 , 4 } based on the number of levels shared (i.e. y=0 encodes no similarity, y=1 encodes class similarity, etc.). In the following two sections, we describe how protein sequences are compared based on their sequences of vector embeddings using soft symmetric alignment and then how this alignment score is used to predict the speciﬁc similarity class by taking advantage of the natural ordering of these classes in an ordinal regression framework.
3.2. S OFT SYMMETRIC ALIGNMENT
In order to calculate the similarity of two amino acid sequences given that each has been encoded into a sequence of vector representations, z 1 ...z n and z (cid:48) 1 ...z (cid:48) m , we develop a soft symmetric alignment mechanism in which the similarity between two sequences is calculated based on their vector embeddings as
[Equation]
where a ij are entries of the alignment matrix given by
[Equation]
and
[Equation]
and A = (cid:80) ni =1 (cid:80) mj
=1 a ij is the length of the alignment.
3.2. O RDINAL REGRESSION
Next, to relate this scalar similarity to the ordinal structural similarities deﬁned using SCOP ( y ∈ { 0 , 1 , 2 , 3 , 4 } ), we adopt an ordinal regression framework.
Speciﬁcally, we learn a series of binary classiﬁers to predict whether the structural similarity level is greater than or equal to each level, t , given the alignment score (Equation 1). Given parameters θ 1 ...θ 4 and b 1 ...b 4 , the probability that two sequences share similarity greater than or equal to t is deﬁned by ˆ p ( y ≥ t ) =
sigmoid ( θ t ˆ s + b t ) , with the constraint that θ t ≥ 0 to enforce that ˆ p increases monotonically with ˆ s .
The structural similarity loss is then given by
[Equation]
These parameters are ﬁt jointly with the parameters of the sequence encoder by backpropogating through the SSA which is fully differentiable.
Furthermore, given these classiﬁers, the predicted probability that two sequences belong to structural similarity level t is ˆ p ( y = t )
=
ˆ p ( y ≥ t )(1 − p ( y ≥ t + 1)) with ˆ p ( y ≥ 0)
= 1 by deﬁnition.
3. R ESIDUE - RESIDUE CONTACT PREDICTION
We can augment our SSA framework, in which position-level correspondence is inferred between sequences, with position-level supervision directly in the form of within protein contacts between residues. We introduce a secondary task of within protein residue-residue contact prediction with the hypothesis that the ﬁne-grained structural supervision provided by the observed contacts will improve the quality of the embeddings.
Contact prediction is a binary classiﬁcation problem in which we seek to predict whether residues at positions i and j within an amino acid sequence make contact in the 3D structure.
Following common practice in the protein structure ﬁeld, we deﬁne two positions as making contact if the Cα atoms of those residues occur within 8Åin the 3D structure.
In order to predict contacts from the sequence of embedding vectors given by the encoder for an arbitrary protein of length N, we deﬁne a pairwise features tensor of size (NxNx2D) where D is the dimension of the embedding vector containing pairwise features given by the concatenation of the absolute element-wise differences and the element-wise products of the vector representations for each pair of positions, v ij =
[ | z i − z
j | ; z i (cid:12) z j ] .
We choose this featurization because it is symmetric, v ij = v ji , and has shown widespread utility for pairwise comparison models in NLP [36].
These vectors are then transformed through a single hidden layer of dimension H (implemented as a width 1 convolutional layer) and ReLU activation giving h ij =
ReLU ( Wv ij + b ) .
Contact predictions are then made by convolving a single 7x7 ﬁlter over the resulting NxNxH tensor with padding and sigmoid activation to give an NxN matrix containing the predicted probability for each pair of residues forming a contact.
Given the observed contacts, we deﬁne the contact prediction loss, L contact , to be the expectation of the cross entropy between the observed labels and the predicted contact probabilities taken over all pairs of residues within each protein in the dataset.
Complete multitask loss. We deﬁne the full multitask objective by
[Equation]
where λ is a parameter that interpolates between the structural similarity and contact prediction losses.
This error signal is backpropogated through the contact prediction speciﬁc parameters deﬁned in section 3.3, the similarity prediction speciﬁc parameters deﬁned in section 3.2, and the parameters of sequence encoder deﬁned in section 3.1 to train the entire model end-to-end. H YPERPARAMETERS AND T RAINING D ETAILS Our encoder consists of 3 biLSTM layers with 512 hidden units each and a ﬁnal output embedding dimension of 100 (Appendix Figure 2).
Language model hidden states are projected into adimension vector before being fed into the encoder. In the contact prediction module, we use a hidden layer with dimension 50. These hyperparameters were chosen to be as large as possible while ﬁtting on a single GPU with reasonable minibatch size. While we compare performance with simpler encoder architectures in section 4.2, it is possible that performance could be improved further with careful architecture search.
However, that is beyond the scope of this work. Sequence embedding models are trained for 100 epochs using ADAM with a learning rate of 0.
and otherwise default parameters provided by PyTorch.
Each epoch consists of 100,000 examples sampled from the SCOP structural similarity training set with smoothing of the similarity level distribution of 0.5.
In other words, the probability of sampling a pair of sequences with similarity level t is proportional to N 0 .
5 t where N t is the number of sequence pairs with t similarity in the training set.
This is to slightly upweight sampling of highly similar pairs of sequences that would otherwise be rare.
We choose 0.5 speciﬁcally such that a minibatch of size 64 is expected to contain two pairs of sequences with family level similarity.
The structural similarity component of the loss is estimated with minibatches of 64 pairs of sequences.
When using the full multitask objective, the contact prediction component uses minibatches of 10 sequences and λ = 0 . 1 .
Furthermore, during training we apply a small perturbation to the sequences by resampling the amino acid at each position from the uniform distribution with probability 0.05. These hyperparameters were selected using a validaton set as described in Appendix section A.2.
All models were implemented in PyTorch and trained on a single NVIDIA Tesla V100 GPU. Each model took roughly 3 days to train and required 16 GB of GPU RAM.
Additional runtime and memory details can be found in Appendix A.3.
In the following sections, we refer to the 3-layer biLSTM encoder trained with the full framework as "SSA (full)" and the framework without contact prediction (i.e. λ = 1 ) as "SSA (no contact prediction)."
R ESULTS 4. S TRUCTURAL SIMILARITY PREDICTION ON THE SCOP DATABASE
We ﬁrst evaluate the performance of our full SSA embedding model for predicting structural similarity between amino acid sequences using the SCOP dataset.
We benchmark our embedding model against several widely used sequence-based protein comparison methods, Needleman-Wunsch alignment (NW-align), phmmer [33], an HMM-to-sequence comparison method, and HHalign [34], an HMMto-HMM comparison method.
For HHalign, proﬂe HMMs for each sequence were constructed by iterative search against the uniref30 database.
We also benchmark our method agains TMalign, a method for evaluating protein similarity based on alignments of protein structures. Details for each of these baselines can be found in Appendix section A.4. Methods are compared based on accuracy of classifying the shared SCOP level, correlation between the similarity score and shared SCOP level, and average precision scores when considering correct matches at each level of the SCOP hierarchy (i.e. proteins that are in the same class, proteins in the same fold, etc.). The SCOP benchmark datasets are formed by splitting the SCOPe ASTRAL 2.06 dataset, ﬁltered to a maximum sequence identity of 95%, into 22,408 train and 5,602 heldout sequences.
From the heldout sequences, we randomly sample 100,000 pairs as the ASTRAL 2.06 structural similarity test set.
Furthermore, we deﬁne a second test set using the newest release of SCOPe (2.07) by collecting all protein sequences added between the 2.06 and 2.07 ASTRAL releases.
This gives a set ofprotein sequences all pairs of which deﬁne the ASTRAL 2.07 new test set.
The average percent identity between pairs of sequences within all three datasets is 13%.
Sequence length statistics can be found in Appendix Table 4.
[Table]
We ﬁnd that our full SSA embedding model outperforms all other methods on all metrics on both datasets. On the 2.06 test set, we improve overall prediction accuracy from 0.79 to 0.95, Pearson’s correlation from 0.37 to 0.91, and Spearman’s rank correlation from 0.23 to 0.69 over the next best sequence comparison method, HHalign, without requiring any database search to construct sequence proﬁles.
Furthermore, our full SSA model is much better for retrieving proteins sharing the same fold — the structural level of most interest for ﬁnding distant protein homologues — improving the average precision score by 0.28 on the 2.06 test set and 0.10 on the 2.07 test set over HHalign.
We ﬁnd that our full SSA embedding model even outperforms TMalign, a method for comparing proteins based on their 3D structures, when predicting shared SCOP membership. This is remarkable considering that our model uses only sequence information when making predictions whereas TMalign is provided with the known protein structures.
The largest improvement comes at the SCOP class level where TMalign achieves much lower average precision score for retrieving these weak structural matches.
4. A BLATION STUDY OF FRAMEWORK COMPONENTS
We next evaluate the individual model components on two tasks: structure similarity prediction on the
ASTRAL 2.06 test set and 8-class secondary structure prediction on a 40% sequence identity ﬁltered dataset containing 22,086 protein sequences from the protein data bank (PDB) [37], a repository of experimentally determined protein structures.
Secondary structure prediction is a sequence labeling problem in which we attempt to classify every position of a protein sequence into one of eight classes describing the local 3D structure at that residue.
We use this task to measure the utility of our embeddings for position speciﬁc prediction problems.
For this problem, we split the secondary structure dataset into 15,461 training and 6,625 testing sequences.
We then treat each position of each sequence as an independent datapoint with features either given by the 100-d embedding vector or 1-hot encoding of the k-mer at that position and train a fully connected neural network (2 hidden layers, 1024 units each, ReLU activations) to predict the secondary structure class from the feature vector.
These models are trained with cross entropy loss for 10 epochs using ADAM with learning rate 0.001 and a minibatch size of 256.
SSA outperforms alternative comparison methods. We ﬁrst demonstrate the importance of our SSA mechanism when training the contextual embedding model by comparing the performance of biLSTM encoders trained with SSA versus the same encoders trained with uniform alignment and a mean embedding comparison approaches [22].
In uniform alignment (UA), we consider a uniform prior over possible alignments giving the similarity score.
For the mean embedding method (ME),
[Table]
we instead calculate the similarity score based on the difference between the average embedding of each sequence.
For these baselines, we substitute
[Equation]
and
[Equation]
[Table]
in for SSA similarity (Equation 1) respectively during model training and prediction. These models are trained without contact prediction ( λ = 1 ) to compare the alignment component in isolation.
We ﬁnd that not only are the SSA embeddings better predictors of secondary structure than k-mer features (accuracy 0.487 vs. 0.444 for 3-mers), but that the SSA mechanism is necessary for achieving best performance on both the structure similarity and local structure prediction tasks.
As seen in table 2, the ME model achieves close to SSA performance on secondary structure prediction, but is signiﬁcantly worse for SCOP similarity prediction.
The UA model, on the other hand, is close to
SSA on SCOP similarity but much worse when predicting secondary structure.
This suggests that our
SSA mechanism captures the best of both methods, allowing embeddings to be position speciﬁc as in the ME model but also being better predictors of SCOP similarity as in the UA model.
Contact prediction improves embeddings.
Although the SSA mechanism allows our embedding model to capture position speciﬁc information, we wanted to explore whether positional information within sequences in the form of contact prediction could be used to improve the embeddings.
We train models with and without the contact prediction task and ﬁnd that including contact prediction improves both the structural similarity prediction and secondary structure prediction results.
The accuracy of secondary structure prediction improves from 0.487 without to 0.630 with contact prediction (Table 2).
This suggests that the contact prediction task dramatically improves the quality of the local embeddings on top of the weak supervision provided by whole structure comparison.
Encoder architecture and pretrained language model are important.
Finally, we show, for the ﬁrst time with biological sequences, that a language model pretrained on a large unsupervised protein sequence database can be used to transfer information to supervised sequence modeling problems.
SCOP similarity classiﬁcation results for SSA embedding models trained with and without LM hidden layer inputs shows that including the LM substantially improves performance, increasing accuracy from 0.898 to 0.938.
Furthermore, we examine the extent to which LM hidden states capture all useful structural information by training SSA embedding models with less expressive power than our 3-layer biLSTM architecture (Appendix Table ?? ). We ﬁnd that the LM hidden states are not sufﬁcient for high performance on the structural similarity task with linear, fully connected (i.e. width [Table]
1 convolution), and single layer biLSTM embedding models having lower accuracy, Pearson, and Spearman correlations than the 3-layer biLSTM on the ASTRAL 2.06 test set.
4. T RANSMEMBRANE PREDICTION
We demonstrate the potential utility of our protein sequence embedding model for transfering structural information to other sequence prediction problems by leveraging our embedding model for transmembrane prediction.
In transmembrane prediction, we wish to detect which, if any, segments of the amino acid sequence cross the lipid bilayer for proteins integrated into the cell membrane.
This is a well studied problem in protein biology with methods generally consisting of HMMs with sophisticated, manually designed hidden state transition distributions and emission distributions including information about residue identity, amino acid frequencies from multiple sequence alignments, local structure, and chemical properties.
Newer methods are also interested in detection of signal peptides, which are short amino acid stretches at the beginning of a protein sequence signaling for this protein to be inserted into the cell membrane.
To benchmark our embedding vectors for this problem, we develop a conditional random ﬁeld (CRF) model in which the propensity of each hidden state given the sequence of embedding vectors is deﬁned by a single layer biLSTM with 100 units. As a baseline, we include an identical biLSTM + CRF model using 1-hot encodings of the amino acids as features.
For the transition probabilities between states, we adopt the same structure as used in TOPCONS [38] and perform 10-fold cross validation on the TOPCONS transmembrane benchmark dataset.
We report results for correctly predicting regions in proteins with only transmembrane domains (TM), transmembrane domains and a signal peptide (SP+TM), neither transmembrane nor signal peptide domains (Globular), or a signal peptide but no transmembrane regions (Globular+SP).
Transmembrane state labels are predicted with Viterbi decoding.
Again following TOPCONS, predictions are counted as correct if, for TM proteins, our model predicts no signal peptide, the same number of transmembrane regions, and those regions overlap with real regions by at least ﬁve positions.
Correct SP+TM predictions are deﬁned in the same way except that proteins must be predicted to start with a signal peptide.
Globular protein predictions are correct if no transmembrane or signal peptides are predicted and Globular+SP predictions are correct if only a leading signal peptide is predicted.
We ﬁnd that our transmembrane predictions rank ﬁrst or tied for ﬁrst in 3 out of the 4 categories (SP+TM, Globular, and Globular+SP) and ranks second for the TM category.
Overall, our transmembrane predictions are best with prediction accuracy of 0.89 vs 0.87 for TOPCONS.
Remarkably, this is by simply replacing the potential function in the CRF with a function of our embedding vectors, the hidden state grammar is the same as that of TOPCONS.
Furthermore, the performance cannot be attributed solely to the biLSTM+CRF structure, as the biLSTM+CRF with 1-hot encoding of the amino acids performs poorly, tying MEMSAT-SVM for worst performance.
This is particularly noteworthy, because TOPCONS is a meta-predictor.
It uses outputs from a wide variety of other transmembrane prediction methods to deﬁne the transmembrane state potentials.
C ONCLUSION
In this work we proposed a novel alignment approach to learning contextual sequence embeddings with weak supervision from a global similarity measure.
Our SSA model is fully differentiable, fast to compute, and can be augmented with position-level structural information, outperforming competition in predicting protein structural similarity.
The resulting embeddings are widely useful, allowing us to improve over the state-of-the-art in transmembrane region prediction and can easily be applied to other protein prediction tasks such as predicting functional properties, active site locations, protein-protein interactions etc. Most methods that use HMM sequence proﬁles of position-speciﬁc scoring matrices could be augmented with our embeddings.
The broader framework extends to other related (non-biological) tasks
A. L ANGUAGE MODEL TRAINING
The bidirectional LSTM language model was trained on the full set of protein domain sequences in the Pfam database, 21,827,419 total sequences.
The language model was trained to predict the amino acid at position i given observations of all amino acids before i and all amino acids after i by minimizing the cross entropy loss with log predicted log probabilities given by the sum of the forward and reverse LM direction predictions
[Equation]
where p F ( x i ) is the probability given by the forward direction LSTM and p R ( x i ) is the probability given by the reverse direction LSTM.
The language model architecture consisted of a 2-layer LSTM with 1024 units in each layer followed by a linear transformation into the 20-d amino acid prediction.
All parameters were shared between the forward and reverse direction components.
The model was trained for a single epoch using
ADAM with a learning rate of 0.001 and minibatch size of 32. A. H YPERPARAMETER S ELECTION
We select the resampling probability and λ hyperparameters based on structural similarity prediction accuracy on a validation set held out from the SCOP ASTRAL 2.06 training set (Section 4.1).
For these experiments, we hold out 2,240 random sequences from the 22,408 sequences of the training set.
From these held out sequences, we randomly sample 100,000 pairs as the validation set.
Encoder
Resampling Contact Prediction Accuracy 3-layer biLSTM (no LM)
no no 0.
3-layer biLSTM (no LM)
yes no 0.
3-layer biLSTM
no no 0.
3-layer biLSTM
yes no 0.
3-layer biLSTM
yes λ = 0 .0.
3-layer biLSTM
yes λ = 0 .0.
3-layer biLSTM
yes λ = 0 .
[Table]
Resampling probability.
We consider models trained with amino acid resampling probability 0.
and without amino acid resampling in the simpliﬁed framework (SSA without contact prediction using the 3-layer biLSTM encoder with and without the language model component.
We ﬁnd that the structural similarity results are slightly improved when using amino acid resampling regardless of whether the included
Table trained with
Multitask loss weight, λ .
We evaluate three values of λ , interpolating between the structural similarity loss and contact prediction loss, for predicting structural similarity on the validation set.
Prediction accuracy increased progressively as λ decreased and all models trained with contact prediction outperformed those trained without contact prediction (Appendix Table 6).
Because it gave the best prediction accuracy on the validation set, λ = 0 .
1 was selected for training models with our full framework.
A. T IME AND M EMORY R EQUIREMENTS
Embedding time and memory scale linearly with sequence length.
Embedding time is very fast ( 0.
ms per amino acid on an NVIDIA V100) and easily ﬁts on a single GPU (<9GB of RAM to embed 130,000 amino acids).
Computing the SSA for sequence comparison scales as the product of the sequence lengths, O(nm), but is easily parallelized on a GPU.
Computing the SSA for all 237, pairs of sequences in the SCOPe ASTRAL 2.07 new test set required on average 0.43 ms per pair (101 seconds total) when each comparison was calculated serially on a single NVIDIA V100.
The contact prediction component scales quadratically with sequence length for both time and memory.
For the NW-align method, similarity between protein sequences was computed using the BLOSUM substitution matrix with gap open and extend penalties of -11 and -1 respectively.
For phmmer, each pair of sequences was compared in both directions (i.e. query->target and target->query) using the ’–max’ option.
The similarity score for each pair was treated as the average off the query->target and target->query scores.
For HHalign, multiple sequence alignments were ﬁrst built for each sequence by using HHblits to search for similar sequences in the uniclust30 database with a maximum of 2 rounds of iteration (-n 2).
Sequences pairs were then scored by using HHalign to score the target->query and query->target HMM-HMM alignments.
Again, the average of the two scores was treated as the overall HHalign score.
Finally, for TMalign, the structures for each pair of proteins were aligned and the scores for the query->target and target->query alignments were averaged to give the overall
TMalign score for each pair of proteins.
To calculate the classiﬁcation accuracy from the above scores, thresholds were found to maximize prediction accuracy when binning scores into similarity levels using 100,000 pairs of sequences sampled from the ASTRAL 2.06 training set.
A. C ONTACT PREDICTION PERFORMANCE
Although we use contact prediction as a secondary task providing position-level structural supervision for the purpose of improving embedding quality and structure similarity prediction, we include results for predicting contacts using the trained contact prediction module here.
The full SSA model has cross entropy loss 0.06214, precision 0.79491, recall 0.77830, F1 score 0.78652, and average precision score 0.89736 when predicting contacts for proteins in the SCOPe ASTRAL 2.06 test set.
On the 2.07 new test set, these numbers are 0.03617, 0.78056, 0.79353, 0.78699, and 0.90717.