Skip to content

For each disease, a directed acyclic graph (DAG) is constructed based on hierarchical descriptors, in which nodes represent disease MeSH descriptors (or disease terms) and edges represent the relationship between the current node and its ancestors. Then compare the DAG Similarity.

Notifications You must be signed in to change notification settings

sirpan/Disease-Mesh-Similarity

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Disease-Mesh-Similarity

For each disease, a directed acyclic graph (DAG) is constructed based on hierarchical descriptors, in which nodes represent disease MeSH descriptors (or disease terms) and edges represent the relationship between the current node and its ancestors. Then compare the DAG Similarity.

Due to network factors, running directly in mainland China can take a lot of time that shouldn't be spent. Therefore, it is highly recommended to use Google Colab.

About

For each disease, a directed acyclic graph (DAG) is constructed based on hierarchical descriptors, in which nodes represent disease MeSH descriptors (or disease terms) and edges represent the relationship between the current node and its ancestors. Then compare the DAG Similarity.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%