A dynamic graph to fold amino acid interaction networks

In this paper, we present a means to fold amino acid interaction networks. This is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. Our approach consists in exploiting the parallel between topological and structural properties. Thus, we establish a relation between the sequence and the structure relying on topological criteria. To fold this type of graph, we limit the topological space and we exploit an ant colony approach. We consider those graphs as dynamic graphs so that we can observe gradually the graph properties during the folding process.