title: Fast construction of assembly trees for molecular graphs.
abstract: A number of modeling and simulation algorithms using internal coordinates rely on hierarchical representations of molecular systems. Given the potentially complex topologies of molecular systems, though, automatically generating such hierarchical decompositions may be difficult. In this article, we present a fast general algorithm for the complete construction of a hierarchical representation of a molecular system. This two-step algorithm treats the input molecular system as a graph in which vertices represent atoms or pseudo-atoms, and edges represent covalent bonds. The first step contracts all cycles in the input graph. The second step builds an assembly tree from the reduced graph. We analyze the complexity of this algorithm and show that the first step is linear in the number of edges in the input graph, whereas the second one is linear in the number of edges in the graph without cycles, but dependent on the branching factor of the molecular graph. We demonstrate the performance of our algorithm on a set of specifically tailored difficult cases as well as on a large subset of molecular graphs extracted from the protein data bank. In particular, we experimentally show that both steps behave linearly in the number of edges in the input graph (the branching factor is fixed for the second step). Finally, we demonstrate an application of our hierarchy construction algorithm to adaptive torsion-angle molecular mechanics.
authors.affiliation: NANO-D, INRIA Grenoble-Rhone-Alpes Research Center, 38334 Saint Ismier Cedex, Montbonnot, France. svetlana.artemova@inria.fr
authors.forename: Svetlana
authors.initials: S
authors.lastname: Artemova
authors.forename: Sergei
authors.initials: S
authors.lastname: Grudinin
authors.forename: Stephane
authors.initials: S
authors.lastname: Redon