BACKGROUND: The design of protein structures from scratch requires special attention to the combination of the types and lengths of the secondary structures and the loops required to build highly designable backbone structure models. However, it is difficult to predict the combinations that result in globular and protein-like conformations without simulations. In this study, we used single-chain three-helix bundles as simple models of protein tertiary structures and sought to thoroughly investigate the conditions required to construct them, starting from the identification of the typical αα-hairpin motifs. RESULTS: First, by statistical analysis of naturally occurring protein structures, we identified three αα-hairpins motifs that were specifically related to the left- and right-handedness of helix-helix packing. Second, specifying these αα-hairpins motifs as junctions, we performed sequence-independent backbone-building simulations to comparatively build single-chain three-helix bundle structures and identified the promising combinations of the length of the α-helix and αα-hairpins types that results in tight packing between the first and third α-helices. Third, using those single-chain three-helix bundle backbone structures as template structures, we designed amino acid sequences that were predicted to fold into the target topologies, which supports that the compact single-chain three-helix bundles structures that we sampled show sufficient quality to allow amino-acid sequence design. CONCLUSION: The enumeration of the dominant subsets of possible backbone structures for small single-chain three-helical bundle topologies revealed that the compact foldable structures are discontinuously and sparsely distributed in the conformational space. Additionally, although the designs have not been experimentally validated in the present research, the comprehensive set of computational structural models generated also offers protein designers the opportunity to skip building similar structures by themselves and enables them to quickly focus on building specialized designs using the prebuilt structure models. The backbone and best design models in this study are publicly accessible from the following URL: https://doi.org/10.5281/zenodo.4321632 .

Motivation: Protein structure alignment is a significant tool to understand evolutionary processes and physicochemical properties of proteins. Important targets of structure alignment are not only monomeric but also oligomeric proteins that sometimes include domain swapping or fusions. Although various protein structural alignment programs have been developed, no method is applicable to any protein pair regardless of the number of chain components and oligomeric states with retaining sequential restrictions: structurally equivalent regions must be aligned in the same order along protein sequences. Results: In this paper, we introduced a new sequential protein structural alignment algorithm MICAN-SQ, which is applicable to protein structures in all oligomeric states. In particular, MICAN-SQ allows the complicated structural alignments of proteins with domain swapping or fusion regions. To validate MICAN-SQ, alignment accuracies were evaluated using curated alignments of monomers and examples of domain swapping, and compared with those of pre-existing protein structural alignment programs. The results of this study show that MICAN-SQ has superior accuracy and robustness in comparison with previous programs and offers limited computational times. We also demonstrate that MICAN-SQ correctly aligns very large complexes and fused proteins. The present computations warrant the consideration of MICAN-SQ for studies of evolutionary and physicochemical properties of monomeric structures and all oligomer types. Availability and implementation: The MICAN program was implemented in C. The source code and executable file can be freely downloaded from http://www.tbp.cse.nagoya-u.ac.jp/MICAN/. Supplementary information: Supplementary data are available at Bioinformatics online.

BACKGROUND: Protein pairs that have the same secondary structure packing arrangement but have different topologies have attracted much attention in terms of both evolution and physical chemistry of protein structures. Further investigation of such protein relationships would give us a hint as to how proteins can change their fold in the course of evolution, as well as a insight into physico-chemical properties of secondary structure packing. For this purpose, highly accurate sequence order independent structure comparison methods are needed. RESULTS: We have developed a novel protein structure alignment algorithm, MICAN (a structure alignment algorithm that can handle Multiple-chain complexes, Inverse direction of secondary structures, Cα only models, Alternative alignments, and Non-sequential alignments). The algorithm was designed so as to identify the best structural alignment between protein pairs by disregarding the connectivity between secondary structure elements (SSE). One of the key feature of the algorithm is utilizing the multiple vector representation for each SSE, which enables us to correctly treat bent or twisted nature of long SSE. We compared MICAN with other 9 publicly available structure alignment programs, using both reference-dependent and reference-independent evaluation methods on a variety of benchmark test sets which include both sequential and non-sequential alignments. We show that MICAN outperforms the other existing methods for reproducing reference alignments of non-sequential test sets. Further, although MICAN does not specialize in sequential structure alignment, it showed the top level performance on the sequential test sets. We also show that MICAN program is the fastest non-sequential structure alignment program among all the programs we examined here. CONCLUSIONS: MICAN is the fastest and the most accurate program among non-sequential alignment programs we examined here. These results suggest that MICAN is a highly effective tool for automatically detecting non-trivial structural relationships of proteins, such as circular permutations and segment-swapping, many of which have been identified manually by human experts so far. The source code of MICAN is freely download-able at http://www.tbp.cse.nagoya-u.ac.jp/MICAN.