A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Graph biased feature selection of genes is better than random for many genes
[article]
2020
bioRxiv
pre-print
Recent work suggests that gene expression dependencies can be predicted almost as well by using random networks as by using experimentally derived interaction networks. We hypothesize that this effect is highly variable across genes, as useful and robust experimental evidence exists for some genes but not others. To explore this variation, we take the k-core decomposition of the STRING network, and compare it to a degree-matched random model. We show that when low-degree nodes are removed,
doi:10.1101/2020.01.17.910703
fatcat:pnpd7lrttvednm7m3urkw4aala