|Integer code for the invariant graph encoding is used as a feature indicator. In this way,the integer associated to each feature (i.e. each pair or neighborhood subgraphs of radius r whose roots are at distance d) can be interpreted as the feature key and the (normalized) count of occurrences as its value. Also copmutes global feature index and returns top dense sets.The candidate clusters are chosen as the top ranking neighborhoods provided that the size of their overlap is below a specified threshold.
hg clone https://toolshed.g2.bx.psu.edu/repos/rnateam/graphclust_nspdk
|Minimum Galaxy Version