资 源 简 介
Introduction
The longest common sub-path finder is a programme that finds the longest common sub-path from a set of paths. It was implemented to analyse the output of NetEffects when looking at the activation or inactivation of biological pathways. The code is general and can be used for any kind of suitable application. Example input files are included in the downloads.
Instructions
Download the zipped file lcspf.zip, which contains the perl executable and the library it depends on. You will need a keys file and a paths file as inputs. The keys file contains the link of each pathway component to its ID, as it is saved in the pathway"s GraphML description in NetEffects. The key file for the Drosophila insulin pathway in NetEffects is available for download.
The paths file contains a list of paths encoded in the following format: "protein1:u:protein2:d", meaning protein1 is activated (up) and it inactivates protein2 (down). Example pa
