GEDEVO: An evolutionary graph edit distance algorithm for biological network alignment

Rashid Ibragimov, Maximilian Malek, Jiong Guo, Jan Baumbach

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

36 Scopus citations


With the so-called OMICS technology the scientific community has generated huge amounts of data that allow us to reconstruct the interplay of all kinds of biological entities. The emerging interaction networks are usually modeled as graphs with thousands of nodes and tens of thousands of edges between them. In addition to sequence alignment, the comparison of biological networks has proven great potential to infer the biological function of proteins and genes. However, the corresponding network alignment problem is computationally hard and theoretically intractable for real world instances.

Original languageEnglish
Title of host publicationGerman Conference on Bioinformatics 2013, GCB 2013
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages12
ISBN (Print)9783939897590
StatePublished - 2013
Externally publishedYes
Event2013 German Conference on Bioinformatics, GCB 2013 - Gottingen, Germany
Duration: 10 Sep 201313 Sep 2013

Publication series

NameOpenAccess Series in Informatics
ISSN (Print)2190-6807


Conference2013 German Conference on Bioinformatics, GCB 2013


  • Evolutionary algorithm
  • Graph edit distance
  • Network alignment
  • Protein-protein interactions


Dive into the research topics of 'GEDEVO: An evolutionary graph edit distance algorithm for biological network alignment'. Together they form a unique fingerprint.

Cite this