Compares pangenome graphs by calculating the segmentation distance between two GFA (Graphical Fragment Assembly) files.
-
Updated
Apr 28, 2026 - Rust
Compares pangenome graphs by calculating the segmentation distance between two GFA (Graphical Fragment Assembly) files.
Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More" (ICML 2021)
Learning Graph Distances with Message PassingNeural Networks
ComfyUI mode that highlights every node by graph distance from the one you click — direct neighbours red, then orange / yellow / green / blue / violet. Focus slider darkens the further bands so you can dial in to one neighbourhood ring at a time.
Lightning-Fast Template-free Protein Folding based on Predicted Residue Contacts and Secondary Structure
reproducing Shimada et al. 2016 "Graph distance for complex networks" paper
This package computes the approximations to the cutnorm using some of the techniques detailed by Alon and Noar [ALON2004] and a fast optimization algorithm by Wen and Yin [WEN2013].
Morphological categorization of neurons in order to explore their functional features has drawn significant attention over past few decades. The enormous complexity in the structure of neurons poses a real challenge in the identification and analysis of similar and dissimilar neuronal cells. Existing methodologies often carry out strutural and g…
Performs PCA with optional graph distance for neighborhood composition.
To associate your repository with the graph-distance topic, visit your repo's landing page and select "manage topics."