MI-GRAAL (Matching-based Integrative GRAph ALigner) AlgorithmOleksii Kuchaiev and Natasa Przulj |
Corresponding author: Prof. Natasa Przulj, e-mail: natasa [AT] cs.ucl.ac.uk
How to run MI-GRAAL:
Sample Usage:
How to convert network from edge list format to .gw file accepted by MI-GRAAL:If your network is in edge list format: node1 node2 node3 node4 ... You can use "list2leda" script (part of CodeAndTestData.zip) to convert it into the format accepted by MI-GRAAL. Use it like this: "./list2leda edgelist.txt >> graph.gw" Note that self-loops, directionality and double edges will be ignored. |