Recursive random forest algorithm for constructing multilayered hierarchical gene regulatory networks that govern biological pathways.
BACKGROUND
Present knowledge indicates a multilayered hierarchical gene regulatory network (ML-hGRN) often operates above a biological pathway. Although the ML-hGRN is very important for understanding how a pathway is regulated, there is almost no computational algorithm for directly constructing ML-hGRNs.


RESULTS
A backward elimination random forest (BWERF) algorithm was developed for constructing the ML-hGRN operating above a biological pathway. For each pathway gene, the BWERF used a random forest model to calculate the importance values of all transcription factors (TFs) to this pathway gene recursively with a portion (e.g. 1/10) of least important TFs being excluded in each round of modeling, during which, the importance values of all TFs to the pathway gene were updated and ranked until only one TF was remained in the list. The above procedure, termed BWERF. After that, the importance values of a TF to all pathway genes were aggregated and fitted to a Gaussian mixture model to determine the TF retention for the regulatory layer immediately above the pathway layer. The acquired TFs at the secondary layer were then set to be the new bottom layer to infer the next upper layer, and this process was repeated until a ML-hGRN with the expected layers was obtained.


CONCLUSIONS
BWERF improved the accuracy for constructing ML-hGRNs because it used backward elimination to exclude the noise genes, and aggregated the individual importance values for determining the TFs retention. We validated the BWERF by using it for constructing ML-hGRNs operating above mouse pluripotency maintenance pathway and Arabidopsis lignocellulosic pathway. Compared to GENIE3, BWERF showed an improvement in recognizing authentic TFs regulating a pathway. Compared to the bottom-up Gaussian graphical model algorithm we developed for constructing ML-hGRNs, the BWERF can construct ML-hGRNs with significantly reduced edges that enable biologists to choose the implicit edges for experimental validation.
School of Forest Resources and Environmental Science, Michigan Technological University, Houghton, MI, United States of America.
Wenping
http://orcid.org/0000-0003-3303-8083
W
Deng
Department of Mathematical Sciences Michigan Technological University, Houghton, MI, United States of America.
Kui
K
Zhang
School of Forest Resources and Environmental Science, Michigan Technological University, Houghton, MI, United States of America.
Victor
V
Busov
School of Forest Resources and Environmental Science, Michigan Technological University, Houghton, MI, United States of America.|Life Science and Technology Institute, Michigan Technological University, Houghton, Michigan, MI, United States of America.
Hairong
H
Wei
D000465:Algorithms; D000818:Animals; D017360:Arabidopsis / Q000235:genetics; D053263:Gene Regulatory Networks; D053858:Metabolic Networks and Pathways / Q000235:genetics*; D051379:Mice; D008957:Models, Genetic