We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.

✖
  • A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Advanced search
Laboratory of Algorithms and Technologies for Networks Analysis (Nizhny Novgorod)
For visually-impairedMenu
HSE Campus in Nizhny Novgorod

Laboratory of Algorithms and Technologies for Networks Analysis (Nizhny Novgorod)

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.

HSE Campus in Nizhny Novgorod → Laboratory of Algorithms and Technologies for Networks Analysis (Nizhny Novgorod) → An Efficient Approach to the Protein Structure Alignment ProblemMikhail Batsyn
Edit
© HSE University 1993–2025  Contacts  Copyright  Privacy Policy  Site Map 

HSE Sans and HSE Slab fonts developed by the HSE Art and Design School