Clustering and Graphs from steady-states correlation matrix #105
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
TolisChal
approved these changes
Aug 23, 2024
|
Thanks @SotirisTouliopoulos! This is nice PR with useful features! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Aim of this PR is to provide functions to dingo/utils.py and dingo/illustrations.py for clustering and graphs analysis of a steady-states correlation matrix alongside visualizations.
Reactions that belong to the same clusters, tend to appear in the same connected subgraphs.
If the given as input correlation matrix is strictly filtered (with a pearson cutoff of ~ 0.9999), then each subgraph created corresponds to a metabolic pathway in a metabolic model (A metabolic pathway is a group of reactions that are either near each other (connected) in the topology of a metabolic network or share metabolites).