A Pseudo de Bruijn Graph Representation for Discretization Orders for Distance Geometry - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

A Pseudo de Bruijn Graph Representation for Discretization Orders for Distance Geometry

(1)
1

Abstract

Instances of the distance geometry can be represented by a simple weighted undirected graph G. Vertex orders on such graphs are discretization orders if they allow for the discretization of the K-dimensional search space of the distance geometry. A pseudo de Bruijn graph B associated to G is proposed in this paper, where vertices correspond to (K+1)-cliques of G, and there is an arc from one vertex to another if, and only if, they admit an overlap, consisting of K vertices of G. This pseudo de Bruijn graph B can be exploited for constructing discretization orders for G for which the consecutivity assumption is satisfied. A new atomic order for protein backbones is presented, which is optimal in terms of length.
Not file

Dates and versions

hal-01196707 , version 1 (10-09-2015)

Identifiers

  • HAL Id : hal-01196707 , version 1

Cite

Antonio Mucherino. A Pseudo de Bruijn Graph Representation for Discretization Orders for Distance Geometry. Proceedings of IWBBIO15, May 2015, Granada, Spain. pp.514-523. ⟨hal-01196707⟩
234 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More