About
Distance Geometry (DG) asks whether an embedding exists for a simple weighted undirected graph G=(V,E,d) such that distances between embedded vertices u and v are the same as the weights d(u,v) in the graph. This problem is NP-hard and it’s been receiving in recent years a growing interest from the scientific community. The focus of this seminar is on a particular class of DG problems, where the weights d(u,v) are subject to change over time. Applications of the “dynamical DG” arise in various research domains: after a quick overview on such applications, the potential extensions of current DG approaches for protein conformations are analyzed with the aim of modeling the dynamics of protein molecules.