Mining networks
In situations where networks are dense and may contain reactions and metabolites not relevant to the current study, we are developing 'mining' methods based on graph algorithms.
The objective is to compute relevant paths between each pair of nodes given a set of nodes. A path is defined as a set of reactions that enables traversal from one element in the network to another. It's worth noting that reactions can only be used once to avoid artificial loops on paths.
Remark: not that reactions can be used only once, avoiding artificial loops on paths.
This function can have two kinds of inputs:
- A selection of nodes: by left clicking on nodes you can select some of them and then start the computation;
- Mapped data: if there is no manual selection, nodes with mapped data will be used for the computation.
This function allows to keep only links and nodes in the subnetwork. All other will be removed.
You can also detect all possible cycles passing through specific node(s).
To do this, select one or more nodes. Then, right-click on one of these nodes to access a contextual menu containing several options, including two for detecting the shortest or longest cycles.
After detecting the cycle, you can access a new tab called 'Cycle' in the Network Manager. This tab allows you to manage cycle drawing.