MOTIVATION: With the increasing availability of 3D-data, the focus of comparative bioinformatic analysis is shifting from protein sequence alignments toward more content-rich 3D-alignments. This raises the need for new ways to improve the accuracy of 3D-superimposition. RESULTS: We proposed guide tree optimization with genetic algorithm (GA) as a universal tool to improve the alignment quality of multiple protein 3D-structures systematically. As a proof of concept, we implemented the suggested GA-based approach in popular Matt and Caretta multiple protein 3D-structure alignment (M3DSA) algorithms, leading to a statistically significant improvement of the TM-score quality indicator by up to 220-1523% on 'SABmark Superfamilies' (in 49-77% of cases) and 'SABmark Twilight' (in 59-80% of cases) datasets. The observed improvement in collections of distant homologies highlights the potentials of GA to optimize 3D-alignments of diverse protein superfamilies as one plausible tool to study the structure-function relationship. AVAILABILITY AND IMPLEMENTATION: The source codes of patched gaCaretta and gaMatt programs are available open-access at https://github.com/n-canter/gamaps. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: Accurate structural alignment of proteins is crucial at studying structure-function relationship in evolutionarily distant homologues. Various software tools were proposed to align multiple protein 3D-structures utilizing one CPU and thus are of limited productivity at large-scale analysis of protein families/superfamilies. RESULTS: The parMATT is a hybrid MPI/pthreads/OpenMP parallel re-implementation of the MATT algorithm to align multiple protein 3D-structures by allowing translations and twists. The parMATT can be faster than MATT on a single multi-core CPU, and provides a much greater speedup when executed on distributed-memory systems, i.e. computing clusters and supercomputers hosting memory-independent computing nodes. The most computationally demanding steps of the MATT algorithm-the initial construction of pairwise alignments between all input structures and further iterative progression of the multiple alignment-were parallelized using MPI and pthreads, and the concluding refinement step was optimized by introducing the OpenMP support. The parMATT can significantly accelerate the time-consuming process of building a multiple structural alignment from a large set of 3D-records of homologous proteins. AVAILABILITY AND IMPLEMENTATION: The source code is available at https://biokinet.belozersky.msu.ru/parMATT. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.