22 April 2024 in Nucleic Acids Research
The possible effects of mutations on stability and function of a protein can only be understood in the context of protein 3D structure. The MutationExplorer webserver maps sequence changes onto protein structures and allows users to study variation by inputting sequence changes. As the user enters variants, the 3D model evolves, and estimated changes in energy are highlighted. In addition to a basic per-residue input format, MutationExplorer can also upload an entire replacement sequence. Previously the purview of desktop applications, such an upload can back-mutate PDB structures to wildtype sequence in a single step. Another supported variation source is human single nucelotide polymorphisms (SNPs), genomic coordinates input in VCF format. Structures are flexibly colorable, not only by energetic differences, but also by hydrophobicity, sequence conservation, or other biochemical profiling. Coloring by interface score reveals mutation impacts on binding surfaces. MutationExplorer strives for efficiency in user experience. For example, we have prepared 45 000 PDB depositions for instant retrieval and initial display. All modeling steps are performed by Rosetta. Visualizations leverage MDsrv/Mol*. MutationExplorer is available at: http://proteinformatics.org/mutation_explorer/.
1 January 2022 in Bioinformatics Advances
Motivation: Protein–protein interactions (PPIs) play an essential role in a great variety of cellular processes and are therefore of significant interest for the design of new therapeutic compounds as well as the identification of side effects due to unexpected binding. Here, we present ProteinPrompt, a webserver that uses machine learning algorithms to calculate specific, currently unknown PPIs. Our tool is designed to quickly and reliably predict contact propensities based on an input sequence in order to scan large sequence libraries for potential binding partners, with the goal to accelerate and assure the quality of the laborious process of drug target identification. Results: We collected and thoroughly filtered a comprehensive database of known binders from several sources, which is available as download. ProteinPrompt provides two complementary search methods of similar accuracy for comparison and consensus building. The default method is a random forest (RF) algorithm that uses the auto-correlations of seven amino acid scales. Alternatively, a graph neural network (GNN) implementation can be selected. Additionally, a consensus prediction is available. For each query sequence, potential binding partners are identified from a protein sequence database. The proteom of several organisms are available and can be searched for binders. To evaluate the predictive power of the algorithms, we prepared a test dataset that was rigorously filtered for redundancy. No sequence pairs similar to the ones used for training were included in this dataset. With this challenging dataset, the RF method achieved an accuracy rate of 0.88 and an area under the curve of 0.95. The GNN achieved an accuracy rate of 0.86 using the same dataset. Since the underlying learning approaches are unrelated, comparing the results of RF and GNNs reduces the likelihood of errors. The consensus reached an accuracy of 0.89. Availability and implementation: ProteinPrompt is available online at: http://proteinformatics.org/ProteinPrompt, where training and test data used to optimize the methods are also available. The server makes it possible to scan the human proteome for potential binding partners of an input sequence within minutes. For local offline usage, we furthermore created a ProteinPrompt Docker image which allows for batch submission: https://gitlab.hzdr.de/proteinprompt/ProteinPrompt. In conclusion, we offer a fast, accurate, easy-to-use online service for predicting binding partners from an input sequence.
9 June 2021 in Nucleic Acids Research
We present an updated version of the Voronoia service that enables fully automated analysis of the atomic packing density of macromolecules. Voronoia combines previous efforts to analyse 3D protein and RNA structures into a single service, combined with state-of-the-art online visualization. Voronoia uses the Voronoi cell method to calculate the free space between neighbouring atoms to estimate van der Waals interactions. Compared to other methods that derive van der Waals interactions by calculating solvent-free surfaces, it explicitly considers volume or packing defects. Large internal voids refer either to water molecules or ions unresolved by X-ray crystallography or cryo-EM, cryptic ligand binding pockets, or parts of a structural model that require further refinement. Voronoia is, therefore mainly used for functional analyses of 3D structures and quality assessments of structural models. Voronoia 4-ever updates the database of precomputed packing densities of PDB entries, allows uploading multiple structures, adds new filter options and facilitates direct access to the results through intuitive display with the NGL viewer. Voronoia is available at: htttp://proteinformatics.org/voronoia.
1 April 2023 in Bioinformatics
Motivation: The SmoothT software and webservice offers the construction of pathways from an ensemble of conformations. The user provides an archive of molecule conformations in Protein Databank (PDB) format, from which a starting and a final conformation need to be selected. The individual PDB files need to contain an energy value or score, estimating the quality of the respective confirmation. Additionally, the user has to provide a root-mean-square deviation (RMSD) cut-off, below which conformations are considered neighboring. From this, SmoothT constructs a graph that connects similar conformations. Results: SmoothT returns the energetically most favorable pathway within in this graph. This pathway is directly displayed as interactive animation using the NGL viewer. Simultaneously, the energy along the pathway is plotted, highlighting the conformation that is currently displayed in the 3D window. Availability and implementation: SmoothT is available as webservice at: http://proteinformatics.org/smoothT. Examples, a tutorial, and FAQs can be found there. Ensembles up to 2 GB (compressed) can be uploaded. Results will be stored for 5 days. The server is completely free and requires no registration. The C++ source code is available at: https://github.com/starbeachlab/smoothT.