An efficient approach to the protein structure alignment problem
The Protein Structure Alignment Problem (PSAP) consists in finding the best alignment of two proteins defined by their primary structures.
In this paper we present an efficient algorithm for the PSAP.
The computational results are provided for the popular Skolnick test set of 40 proteins and show that the suggested algorithm is more efficient than one of the fastest PSAP solvers – the ACF algorithm by Malod-Dognin et al. (2010).
protein structure alignment, branch-and-bound algorithm