{"id":"oscr:b:F4MMW8ZS4WSS0-L","url":"https://openscicode.org/b/oscr:b:F4MMW8ZS4WSS0-L","status":"current","doi":"10.1038/s41598-021-99167-2","since":"2026-11-20","page":"doi_10.1038_s41598-021-99167-2","repo":"github.com/ghoshlab/osimonscripts","commit":"d21db9e52f9b8c720074e80f400d47f88f64dbe7","path":"ConnectivityPaper/OS_MEGmakeCircularGrangerMSTs02.m","swhid":"swh:1:cnt:e2caf6020558b1f74f430248b17c224462a49b4b","lines":[516,529],"symbol":"12. Run the node class permutation on the 3-class pooled MST","paragraphs":[[29,"Methods › Minimum spanning tree (MST) analysis"]],"method":"lexical-v1","origin":"machine","paper":"https://doi.org/10.1038/s41598-021-99167-2","swhid_qualified":"swh:1:cnt:e2caf6020558b1f74f430248b17c224462a49b4b;origin=https://github.com/ghoshlab/osimonscripts;anchor=swh:1:rev:d21db9e52f9b8c720074e80f400d47f88f64dbe7;path=/ConnectivityPaper/OS_MEGmakeCircularGrangerMSTs02.m;lines=516-529","reader":"https://openscicode.org/paper/doi_10.1038_s41598-021-99167-2/?path=ConnectivityPaper%2FOS_MEGmakeCircularGrangerMSTs02.m#L516-L529","citation":"Code block oscr:b:F4MMW8ZS4WSS0-L (https://openscicode.org/b/oscr:b:F4MMW8ZS4WSS0-L)\nConnectivityPaper/OS_MEGmakeCircularGrangerMSTs02.m, lines 516 to 529, in github.com/ghoshlab/osimonscripts (https://github.com/ghoshlab/osimonscripts), commit d21db9e52f9b8c720074e80f400d47f88f64dbe7.\nPaper: https://doi.org/10.1038/s41598-021-99167-2\nSWHID: swh:1:cnt:e2caf6020558b1f74f430248b17c224462a49b4b;origin=https://github.com/ghoshlab/osimonscripts;anchor=swh:1:rev:d21db9e52f9b8c720074e80f400d47f88f64dbe7;path=/ConnectivityPaper/OS_MEGmakeCircularGrangerMSTs02.m;lines=516-529"}