inexact-graph-matching-brain-networks
CommunityCompare brain networks via inexact graph matching.
Education & Research#neuroscience#graph-edit-distance#brain-networks#functional-connectivity#heritability#node-mapping#graph-matching
Authorhiyenwong
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Brain network comparisons often suffer from uncertain node correspondences due to individual variability. This skill provides an inexact graph matching approach to quantify similarities between brain networks.
Core Features & Use Cases
- Graph Edit Distance: Compute the minimum-cost edits between two brain graphs to quantify dissimilarity.
- Node Correspondence Mapping: Output the likely node mapping between brain regions to interpret differences.
- Use Case: Compare monozygotic vs dizygotic twin brain networks to study heritability, or track developmental changes over time.
Quick Start
Provide two brain graphs to compute their graph edit distance and node mappings.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: inexact-graph-matching-brain-networks Download link: https://github.com/hiyenwong/ai_collection/archive/main.zip#inexact-graph-matching-brain-networks Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.