Classical simulations of protein flexibility remain computationally expensive, especially for large proteins. A few years ago, we developed a fast method for predicting protein structure fluctuations that uses a single protein model as the input. The method has been made available as the CABS-flex web server and applied in numerous studies of protein structure-function relationships. Here, we present a major update of the CABS-flex web server to version 2.0. The new features include: extension of the method to significantly larger and multimeric proteins, customizable distance restraints and simulation parameters, contact maps and a new, enhanced web server interface. CABS-flex 2.0 is freely available at http://biocomp.chem.uw.edu.pl/CABSflex2.

CABS-flex standalone is distributed under the MIT license, which is free for academic and non-profit users. It is implemented in Python. CABS-flex source code, wiki with examples of use and installation instructions for Linux, macOS and Windows are available from the CABS-flex standalone repository at https://bitbucket.org/lcbio/cabsflex.

Summary CABS-dock standalone is a multiplatform Python package for protein–peptide docking with backbone flexibility. The main feature of the CABS-dock method is its ability to simulate significant backbone flexibility of the entire protein–peptide system in a reasonable computational time. In the default mode, the package runs a simulation of fully flexible peptide searching for a binding site on the surface of a flexible protein receptor. The flexibility level of the molecules may be defined by the user. Furthermore, the CABS-dock standalone application provides users with full control over the docking simulation from the initial setup to the analysis of results. The standalone version is an upgrade of the original web server implementation—it introduces a number of customizable options, provides support for large-sized systems and offers a framework for deeper analysis of docking results. Availability and implementation CABS-dock standalone is distributed under the MIT licence, which is free for academic and non-profit users. It is implemented in Python and Fortran. The CABS-dock standalone source code, wiki with documentation and examples of use and installation instructions for Linux, macOS and Windows are available in the CABS-dock standalone repository at https://bitbucket.org/lcbio/cabsdock.

This study aimed to verify the taxonomic relationships within the genus Secale. The plant material included 16 wild rye accessions from four species. Two approaches were applied: 1) whole genome scanning using three molecular marker systems: diversity arrays technology sequencing, simple sequence repeats and sequence-specific amplification polymorphism; and 2) characterisation based on polymorphisms within the sequences of two genes involved in benzoxazinoid biosynthesis: ScBx1 and ScBx5. Bayesian and neighbour-joining clustering and principal coordinate analysis were applied to illustrate relationships among species and accessions of Secale based on genetic distance (GD) matrices. Pearson’s correlation analysis between GD matrices was conducted. Clustering of Secale accessions revealed that S. sylvestre samples were the most divergent. The remaining accessions formed two clusters. One of them comprised S. strictum accessions while the second cluster consisted of subspecies of S. cereale, the species S. vavilovii and S. strictum subsp. ciliatoglume.

Motivation The well-known fact that protein structures are more conserved than their sequences forms the basis of several areas of computational structural biology. Methods based on the structure analysis provide more complete information on residue conservation in evolutionary processes. This is crucial for the determination of evolutionary relationships between proteins and for the identification of recurrent structural patterns present in biomolecules involved in similar functions. However, algorithmic structural alignment is much more difficult than multiple sequence alignment. This study is devoted to the development and applications of DAMA—a novel effective environment capable to compute and analyze multiple structure alignments. Results DAMA is based on local structural similarities, using local 3D structure descriptors and thus accounts for nearest-neighbor molecular environments of aligned residues. It is constrained neither by protein topology nor by its global structure. DAMA is an extension of our previous study (DEDAL) which demonstrated the applicability of local descriptors to pairwise alignment problems (Daniluk and Lesyng, 2011). Since the multiple alignment problem is NP-complete (Daniluk and Lesyng, 2014), an effective heuristic approach has been developed without imposing any artificial constraints. The alignment algorithm searches for the largest, consistent ensemble of similar descriptors. The new method is capable to capture most of the biologically significant similarities present in canonical test sets and is discriminatory enough to prevent the emergence of larger, but meaningless, solutions. Tests performed on the test sets, including protein kinases, demonstrate DAMA’s capability of identifying equivalent residues, which should be very useful in discovering the biological nature of proteins similarity. Performance profiles show the advantage of DAMA over other methods, in particular when using a strict similarity measure QC, which is the ratio of correctly aligned columns, and when applying the methods to more difficult cases. Availability DAMA is available online at http://dworkowa.imdik.pan.pl/EP/DAMA. Linux binaries of the software are available upon request. Supplementary information Supplementary data are available at Bioinformatics online.