Structure- and Function-Aware Substitution Matrices via Differentiable Graph Matching

Paolo Pellizzoni, Carlos Oliver, Karsten Borgwardt

Keywords: Graph matching, optimal transport, bioinformatics

TL;DR: We propose a method to learn substitution matrices for biochemical structures from data.

Abstract:

Substitution matrices, which are crafted to quantify the functional impact of substitutions or deletions in biomolecules, are central component of remote homology detection, functional element discovery, and structure prediction algorithms. However, they are often limited to sequence data and the conditioning on external priors can only be given implicitly through the curation of the ground-truth alignments they are crafted on.
Here we propose an algorithmic framework, based on regularized optimal transport, for learning graph-based substitution matrices from data, conditioned on any functional knowledge.
In particular, our graph-neural-network-based model learns to produce substitution matrices and graph matchings such
that the resulting metric correlates with the function at hand.
Our method shows promising performance in functional similarity classification and shows potential for interpreting the functional importance of molecular substructures.

Submission Number: 46