Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
A Pseudo de Bruijn Graph Representation for Discretization Orders for Distance Geometry
verfasst von : Antonio Mucherino
Erschienen in: Bioinformatics and Biomedical Engineering
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.