What is GEDEVO?

GEDEVO, is a software tool for solving the network alignment problem. GEDEVO stands for Graph Edit Distance + EVOlution and it utilizes the evolutionary computing strategies for solving the so-called Graph Edit Distance problem (see also GEDEVO-M)

What is Network Alignment?

Network Alignment is a computationally hard bioinformatic problem. It aims to find the "best" one-to-one correspondence between nodes from two input networks without using any external knowledge, such as sequence similarity. In GEDEVO the "best" alignment is the one, which has the lowest graph editing cost. Applied to Protein-Protein Interaction (PPI) networks, Network Alignment, finds its applications in the validation of interactions and the prediction of new ones, as well as for extracting conserved subnetworks in a set of given PPI networks. Network Alignment is a novel basis, in addition to DNA and amino acid sequence similarity, for further interspecies network analysis in drug development, including (functional) knowledge transfer between species.

Illustration of GED

Transforming graph G1 graph into G2
      delete edge e1 delete node n1
      delete edge e2 insert edge e4
      insert node n2 insert edge e3.

Cost of edit operations:
      deletion/insertion of edges/nodes – 1,
      substitution of nodes/edges – 0.

GED(G1, G2)=6
transforming one graph into the other

Download

Here are the links to download GEDEVO:

source code repo (for GEDEVO and NABEECO; available from April, 2014)
README.txt
linux64
win32
freebsd64
data
example.sh

How to run GEDEVO


Citation

Rashid Ibragimov, Maximilian Malek, Jiong Guo, Jan Baumbach: GEDEVO: An Evolutionary Graph Edit Distance Algorithm for Biological Network Alignment. GCB 2013:68-79

Where was GEDEVO developed?

GEDEVO was mainly developed at the Computational Systems Biology Group of the Max-Planck-Institut für Informatik in Saarbrücken
Visit also LINK1 and LINK2 for further publications of our group


Other network alignment tools