Discovery Of Short Linear Motifs Research Articles

Systematic Discovery of Short Linear Motifs Decodes Calcineurin Phosphatase Signaling

Short linear motifs (SLiMs) drive dynamic protein-protein interactions essential for signaling, but sequence degeneracy and low binding affinities make them difficult to identify. We harnessed unbiased systematic approaches for SLiM discovery to elucidate the regulatory network of calcineurin (CN)/PP2B, the Ca2+-activated phosphatase that recognizes LxVP and PxIxIT motifs. Invitro proteome-wide detection of CN-binding peptides, invivo SLiM-dependent proximity labeling, and in silico modeling of motif determinants uncovered unanticipated CN interactors, including NOTCH1, which we establish as a CN substrate. Unexpectedly, CN shows SLiM-dependent proximity to centrosomal and nuclear pore complex (NPC) proteins-structures where Ca2+ signaling is largely uncharacterized. CN dephosphorylates human and yeast NPC proteins and promotes accumulation of a nuclear transport reporter, suggesting conserved NPC regulation by CN. The CN network assembled here provides a resource to investigate Ca2+ and CN signaling and demonstrates synergy between experimental and computational methods, establishing a blueprint for examining SLiM-based networks.

Combinatorial Avidity Selection of Mosaic Landscape Phages Targeted at Breast Cancer Cells—An Alternative Mechanism of Directed Molecular Evolution

Low performance of actively targeted nanomedicines required revision of the traditional drug targeting paradigm and stimulated the development of novel phage-programmed, self-navigating drug delivery vehicles. In the proposed smart vehicles, targeting peptides, selected from phage libraries using traditional principles of affinity selection, are substituted for phage proteins discovered through combinatorial avidity selection. Here, we substantiate the potential of combinatorial avidity selection using landscape phage in the discovery of Short Linear Motifs (SLiMs) and their partner domains. We proved an algorithm for analysis of phage populations evolved through multistage screening of landscape phage libraries against the MDA-MB-231 breast cancer cell line. The suggested combinatorial avidity selection model proposes a multistage accumulation of Elementary Binding Units (EBU), or Core Motifs (CorMs), in landscape phage fusion peptides, serving as evolutionary initiators for formation of SLiMs. Combinatorial selection has the potential to harness directed molecular evolution to create novel smart materials with diverse novel, emergent properties.

HH-MOTiF: de novo detection of short linear motifs in proteins by Hidden Markov Model comparisons.

Short linear motifs (SLiMs) in proteins are self-sufficient functional sequences that specify interaction sites for other molecules and thus mediate a multitude of functions. Computational, as well as experimental biological research would significantly benefit, if SLiMs in proteins could be correctly predicted de novo with high sensitivity. However, de novo SLiM prediction is a difficult computational task. When considering recall and precision, the performances of published methods indicate remaining challenges in SLiM discovery. We have developed HH-MOTiF, a web-based method for SLiM discovery in sets of mainly unrelated proteins. HH-MOTiF makes use of evolutionary information by creating Hidden Markov Models (HMMs) for each input sequence and its closely related orthologs. HMMs are compared against each other to retrieve short stretches of homology that represent potential SLiMs. These are transformed to hierarchical structures, which we refer to as motif trees, for further processing and evaluation. Our approach allows us to identify degenerate SLiMs, while still maintaining a reasonably high precision. When considering a balanced measure for recall and precision, HH-MOTiF performs better on test data compared to other SLiM discovery methods. HH-MOTiF is freely available as a web-server at http://hh-motif.biochem.mpg.de.

HH-MOTiF: de novo detection of short linear motifs in proteins by Hidden Markov Model comparisons.

Short linear motifs (SLiMs) in proteins are self-sufficient functional sequences that specify interaction sites for other molecules and thus mediate a multitude of functions. Computational, as well as experimental biological research would significantly benefit, if SLiMs in proteins could be correctly predicted de novo with high sensitivity. However, de novo SLiM prediction is a difficult computational task. When considering recall and precision, the performances of published methods indicate remaining challenges in SLiM discovery. We have developed HH-MOTiF, a web-based method for SLiM discovery in sets of mainly unrelated proteins. HH-MOTiF makes use of evolutionary information by creating Hidden Markov Models (HMMs) for each input sequence and its closely related orthologs. HMMs are compared against each other to retrieve short stretches of homology that represent potential SLiMs. These are transformed to hierarchical structures, which we refer to as motif trees, for further processing and evaluation. Our approach allows us to identify degenerate SLiMs, while still maintaining a reasonably high precision. When considering a balanced measure for recall and precision, HH-MOTiF performs better on test data compared to other SLiM discovery methods. HH-MOTiF is freely available as a web-server at http://hh-motif.biochem.mpg.de.

SLiMScape 3.x: a Cytoscape 3 app for discovery of Short Linear Motifs in protein interaction networks

Short linear motifs (SLiMs) are small protein sequence patterns that mediate a large number of critical protein-protein interactions, involved in processes such as complex formation, signal transduction, localisation and stabilisation. SLiMs show rapid evolutionary dynamics and are frequently the targets of molecular mimicry by pathogens. Identifying enriched sequence patterns due to convergent evolution in non-homologous proteins has proven to be a successful strategy for computational SLiM prediction. Tools of the SLiMSuite package use this strategy, using a statistical model to identify SLiM enrichment based on the evolutionary relationships, amino acid composition and predicted disorder of the input proteins. The quality of input data is critical for successful SLiM prediction. Cytoscape provides a user-friendly, interactive environment to explore interaction networks and select proteins based on common features, such as shared interaction partners. SLiMScape embeds tools of the SLiMSuite package for de novo SLiM discovery (SLiMFinder and QSLiMFinder) and identifying occurrences/enrichment of known SLiMs (SLiMProb) within this interactive framework. SLiMScape makes it easier to (1) generate high quality hypothesis-driven datasets for these tools, and (2) visualise predicted SLiM occurrences within the context of the network. To generate new predictions, users can select nodes from a protein network or provide a set of Uniprot identifiers. SLiMProb also requires additional query motif input. Jobs are then run remotely on the SLiMSuite server ( http://rest.slimsuite.unsw.edu.au) for subsequent retrieval and visualisation. SLiMScape can also be used to retrieve and visualise results from jobs run directly on the server. SLiMScape and SLiMSuite are open source and freely available via GitHub under GNU licenses.

SLiMScape 3.x: a Cytoscape 3 app for discovery of Short Linear Motifs in protein interaction networks.

Short linear motifs (SLiMs) are small protein sequence patterns that mediatea large number of critical protein-protein interactions, involved in processes suchas complex formation, signal transduction, localisation and stabilisation. SLiMsshow rapid evolutionary dynamics and are frequently the targets of molecularmimicry by pathogens. Identifying enriched sequence patterns due to convergentevolution in non-homologous proteins has proven to be a successful strategy forcomputational SLiM prediction. Tools of the SLiMSuite package use this strategy,using a statistical model to identify SLiM enrichment based on the evolutionary relationships,amino acid composition and predicted disorder of the input proteins.The quality of input data is critical for successful SLiM prediction. Cytoscape providesa user-friendly, interactive environment to explore interaction networks andselect proteins based on common features, such as shared interaction partners.SLiMScape embeds tools of the SLiMSuite package for de novo SLiM discovery(SLiMFinder and QSLiMFinder) and identifying occurrences/enrichment of knownSLiMs (SLiMProb) within this interactive framework. SLiMScape makes it easier to(1) generate high quality hypothesis-driven datasets for these tools, and (2) visualisepredicted SLiM occurrences within the context of the network.To generate new predictions, users can select nodes from a protein network orprovide a set of Uniprot identifiers. SLiMProb also requires additional query motifinput. Jobs are then run remotely on the SLiMSuite server ( http://rest.slimsuite.unsw.edu.au) for subsequent retrieval and visualisation. SLiMScapecan also be used to retrieve and visualise results from jobs run directly onthe server. SLiMScape and SLiMSuite are open source and freely available viaGitHub under GNU licenses.

Computational prediction of short linear motifs from protein sequences.

Short Linear Motifs (SLiMs) are functional protein microdomains that typically mediate interactions between a short linear region in one protein and a globular domain in another. SLiMs usually occur in structurally disordered regions and mediate low affinity interactions. Most SLiMs are 3-15 amino acids in length and have 2-5 defined positions, making them highly likely to occur by chance and extremely difficult to identify. Nevertheless, our knowledge of SLiMs and capacity to predict them from protein sequence data using computational methods has advanced dramatically over the past decade. By considering the biological, structural, and evolutionary context of SLiM occurrences, it is possible to differentiate functional instances from chance matches in many cases and to identify new regions of proteins that have the features consistent with a SLiM-mediated interaction. Their simplicity also makes SLiMs evolutionarily labile and prone to independent origins on different sequence backgrounds through convergent evolution, which can be exploited for predicting novel SLiMs in proteins that share a function or interaction partner. In this review, we explore our current knowledge of SLiMs and how it can be applied to the task of predicting them computationally from protein sequences. Rather than focusing on specific SLiM prediction tools, we provide an overview of the methods available and concentrate on principles that should continue to be paramount even in the light of future developments. We consider the relative merits of using regular expressions or profiles for SLiM discovery and discuss the main considerations for both predicting new instances of known SLiMs, and de novo prediction of novel SLiMs. In particular, we highlight the importance of correctly modelling evolutionary relationships and the probability of false positive predictions.

Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated proteins

BackgroundLarge datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing methods for estimating the probability of motif recurrence may be biased by the size and composition of the search dataset, such that p-value estimates from different datasets, or from motifs containing different numbers of non-wildcard positions, are not strictly comparable. Here, we develop more exact methods and explore the potential biases of computationally efficient approximations.ResultsA widely used heuristic for the calculation of motif over-representation approximates motif probability by assuming that all proteins have the same length and composition. We introduce pv, which calculates the probability exactly. Secondly, the recently introduced SLiMFinder statistic Sig, accounts for multiple testing (across all possible motifs) in motif discovery. However, it approximates the probability of all other possible motifs, occurring with a score of p or less, as being equal to p. Here, we show that the exhaustive calculation of the probability of all possible motif occurrences that are as rare or rarer than the motif of interest, Sig', may be carried out efficiently by grouping motifs of a common probability (i.e. those which have permuted orders of the same residues). Sig'v, which corrects both approximations, is shown to be uniformly distributed in a random dataset when searching for non-ambiguous motifs, indicating that it is a robust significance measure.ConclusionsA method is presented to compute exactly the true probability of a non-ambiguous short protein sequence motif, and the utility of an approximate approach for novel motif discovery across a large number of datasets is demonstrated.

Computational identification and analysis of protein short linear motifs

Short linear motifs (SLiMs) in proteins can act as targets for proteolytic cleavage, sites of post-translational modification, determinants of sub-cellular localization, and mediators of protein-protein interactions. Computational discovery of SLiMs involves assembling a group of proteins postulated to share a potential motif, masking out residues less likely to contain such a motif, down-weighting shared motifs arising through common evolutionary descent, and calculation of statistical probabilities allowing for the multiple testing of all possible motifs. Much of the challenge for motif discovery lies in the assembly and masking of datasets of proteins likely to share motifs, since the motifs are typically short (between 3 and 10 amino acids in length), so that potential signals can be easily swamped by the noise of stochastically recurring motifs. Focusing on disordered regions of proteins, where SLiMs are predominantly found, and masking out non-conserved residues can reduce the level of noise but more work is required to improve the quality of high-throughput experimental datasets (e.g. of physical protein interactions) as input for computational discovery.

Masking residues using context-specific evolutionary conservation significantly improves short linear motif discovery

Short linear motifs (SLiMs) are important mediators of protein-protein interactions. Their short and degenerate nature presents a challenge for computational discovery. We sought to improve SLiM discovery by incorporating evolutionary information, since SLiMs are more conserved than surrounding residues. We have developed a new method that assesses the evolutionary signal of a residue in its sequence and structural context. Under-conserved residues are masked out prior to SLiM discovery, allowing incorporation into the existing statistical model employed by SLiMFinder. The method shows considerable robustness in terms of both the conservation score used for individual residues and the size of the sequence neighbourhood. Optimal parameters significantly improve return of known functional motifs from benchmarking data, raising the return of significant validated SLiMs from typical human interaction datasets from 20% to 60%, while retaining the high level of stringency needed for application to real biological data. The success of this regime indicates that it could be of general benefit to computational annotation and prediction of protein function at the sequence level. All data and tools in this article are available at http://bioware.ucd.ie/~slimdisc/slimfinder/conmasking/.