Constrained Shape Analysis with Applications to RNA Structure
Kanti V. Mardia, Benjamin Eltzner, Stephan F. Huckemann
TL;DR
Constrained Shape Analysis with Applications to RNA Structure develops a unified framework for analyzing biomolecular shapes under length constraints by introducing polypolar coordinates and polysphere representations. It combines multicentring with polypolar coordinates to separate constrained radial lengths from unconstrained torsions, enabling tractable modeling and analysis on constrained shape spaces. The paper provides concrete RNA-centered examples, discusses concentration-based statistics and tangent-projection methods, and introduces distributions on polypolar spaces alongside an extended clustering approach (MINT-AGE) with parametric mode hunting for very small clusters. These ideas offer a principled route to analyzing RNA backbone conformations under partial information and pave the way for unsupervised learning in constrained biomolecular shape analysis.
Abstract
In many applications of shape analysis, lengths between some landmarks are constrained. For instance, biomolecules often have some bond lengths and some bond angles constrained, and variation occurs only along unconstrained bonds and constrained bonds' torsions where the latter are conveniently modelled by dihedral angles. Our work has been motivated by low resolution biomolecular chain RNA where only some prominent atomic bonds can be well identified. Here, we propose a new modelling strategy for such constrained shape analysis starting with a product of polar coordinates (polypolars), where, due to constraints, for example, some radial coordinates should be omitted, leaving products of spheres (polyspheres). We give insight into these coordinates for particular cases such as five landmarks which are motivated by a practical RNA application. We also discuss distributions for polypolar coordinates and give a specific methodology with illustration when the constrained size-and-shape variables are concentrated. There are applications of this in clustering and we give some insight into a modified version of the MINT-AGE algorithm.
