DeepAI AI Chat
Log In Sign Up

Computation Protein Design instances with small tree-width: selection based on coarse approximated 3D average position volume

by   David Allouche, et al.

This paper proposes small tree-width graph decomposition computational protein design CFN instances defined according to the model [1] with protocol defined by Simononcini et al [2] . The proteins used in the benchmark have been selected in the PDB (not on their biological interest) to explore the efficiency of global search method based on tree-width decomposition. The instances are bigger than those previously proposed in the paper [2] with one backbone relaxation and the aka Beta November 2016 Rosetta force-field [3]. The benchmark includes 21 proteins selected with a low level of sequences identity (40 applying a decreasing average coarse volume occupancy filter by Amino Acid (-i.e. by CFN variable) . The instances characteristic (see Table 1) contain from 130 up to n = 282 variables with a maximum domain size from 383 to 438, and between 1706 and 6208 cost functions. The min-fill tree-width ranges from 21 to 68, and from 0.16 to 0.34 for a normalized tree width. Those instances have been used for UDGVNS search algorithm[4] benchmarking. This approach is suitable for evaluation of search methods that exploit the notion of graph decomposition.


page 7

page 8


A Constraint Model for the Tree Decomposition of a Graph

We present a constraint model for the problem of producing a tree decomp...

Tree-width dichotomy

We prove that the tree-width of graphs in a hereditary class defined by ...

Characterizations and Directed Path-Width of Sequence Digraphs

Computing the directed path-width of a directed graph is an NP-hard prob...

A new width parameter of graphs based on edge cuts: α-edge-crossing width

We introduce graph width parameters, called α-edge-crossing width and ed...

Learning to Accelerate Decomposition for Multi-Directional 3D Printing

Multi-directional 3D printing has the capability of decreasing or elimin...

Minimum Error Tree Decomposition

This paper describes a generalization of previous methods for constructi...