Discovering Pathways by Orienting Edges in Protein Interaction Networks

Download software

Java source code (version 1.1.0) implementing all Maximum Edge Orientation (MEO) algorithms described in the paper can be downloaded here. The latest source code is also available on GitHub. By downloading this software, you agree to the terms of the license below (New BSD License). If you use this software in a publication, please cite:
Discovering Pathways by Orienting Edges in Protein Interaction Networks
Anthony Gitter, Judith Klein-Seetharaman, Anupam Gupta, Ziv Bar-Joseph.
Nucleic Acids Research. 39:4, 2011.

Contact Anthony Gitter with any questions or comments about the code or to report a bug.

All versions (version log):
Version 1.1.0
Version 1.0.0

The MIN-k-SAT-based orientation algorithm relies on the lp_solve Mixed Integer Linear Programming solver, which is not distributed with our Java code and can be downloaded here. Instructions for installing lp_solve and using it with the Java code via the JNI API can be found here. lp_solve is no longer required by default.

The MAX-k-CSP-based algorithm uses toulbar2, which is described here and available for download here. There is no JNI wrapper for toulbar2, thus our orientation algorithm will generate a weighted CSP instance in the XML XCSP format, use toulbar2 to solve the CSP, and read the CSP solution to the orient the network.

Back to main page