An Efficient Approach to the Protein Structure Alignment ProblemMikhail Batsyn
Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, Niznhy Novgorod, Russia
The Protein Structure Alignment Problem (PSAP) consists in finding the best alignment of two proteins defined by their primary structures. It finds the most similar substructure of two proteins. This problem is polynomially reducible to the Maximum Clique Problem (MCP) for the protein alignment graph. In this talk we present an efficient algorithm for the PSAP based on our recent ILS&MCS algorithm (Batsyn et al., 2014) for the MCP.
Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.