| Based on a newly developed theory of the sample mean of a set of graphs, we show how multiple structure alignment, consensus contact prediction and multi-template homology modelling can be phrased as graph problems. Since this leads to NP-hard problems in many cases, we propose heuristic algorithms to approximate the optimal solution. We show applications in modelling the effects of cancer mutations on protein structure and function. |
|