GEDEVO

GEDEVO applies an evolutionary algorithm to minimize Graph Edit Distance for aligning biological networks to compare topology and infer functional and evolutionary relationships.


Key Features:

  • Graph Edit Distance (GED) model: Uses a GED model that transforms one graph into another with minimal costs associated with edge insertions and deletions.
  • Evolutionary optimization: Employs an evolutionary algorithm to minimize the GED and obtain optimal or near-optimal network alignments.
  • Scalability: Targets real-world-sized biological networks modeled as graphs with thousands of nodes and tens of thousands of edges.
  • Comparative performance: Demonstrated improved performance in comparative studies versus SPINAL, GHOST, CGRAAL, and MIGRAAL.
  • Topology refinement: Capable of refining alignments that were initially suggested based solely on topological information.
  • Biological data compatibility: Applied to protein-protein interaction networks from various organisms.

Scientific Applications:

  • Network alignment: Aligns biological interaction networks to facilitate comparison of network topology across species or conditions.
  • Function inference: Supports inference of protein and gene function based on conserved interaction patterns revealed by alignments.
  • Evolutionary analysis: Enables assessment of evolutionary relationships between organisms through comparative network structure.
  • PPI network analysis: Applied to protein-protein interaction networks to compare interaction architectures across organisms.

Methodology:

GEDEVO models alignment as minimizing Graph Edit Distance (edge insertion/deletion costs) and optimizes this objective using an evolutionary algorithm.

Topics

Details

Tool Type:
command-line tool
Operating Systems:
Linux, Windows, Mac
Added:
8/4/2015
Last Updated:
12/10/2018

Operations

Data Inputs & Outputs

Pathway or network comparison

Other operations do not define inputs or outputs.

Publications

Ibragimov R, Malek M, Guo J, Baumbach J. GEDEVO: An Evolutionary Graph Edit Distance Algorithm for Biological Network Alignment [Internet]. Beißbarth T, Kollmar M, Leha A, Morgenstern B, Schultz A-K, Waack S, et al., editors. Vol. 34, OASIcs, Volume 34, GCB 2013. Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2013. p. 68–79. Available from: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.GCB.2013.68

Documentation