IEEE Transactions on Computational Biology and BioinformaticsBioinformaticsPeer-reviewed journal article
Rapid Reconstruction of Time-varying Gene Regulatory Networks
Abstract
--Rapid advancements in high-throughput technologies has resulted in genome-scale time series datasets. Uncovering the temporal sequence of gene regulatory events, in the form of time-varying gene regulatory networks (GRNs), demands computationally fast, accurate and scalable algorithms. The existing algorithms can be divided into two categories: ones that are time-intensive and hence unscalable; others that impose structural constraints to become scalable. In this paper, a novel algorithm, namely an algorithm for reconstructing Time-varying Gene regulatory networks with Shortlisted candidate regulators (TGS), is proposed. TGS is time-efficient and does not impose any structural constraints. Moreover, it provides such flexibility and time-efficiency, without losing its accuracy. TGS consistently outperforms the state-of-the-art algorithms in true positive detection, on three benchmark synthetic datasets. However, TGS does not perform as well in false positive rejection. To mitigate this issue, TGS+ is proposed. TGS+ demonstrates competitive false positive rejection power, while maintaining the superior speed and true positive detection power of TGS. Nevertheless, main memory requirements of both TGS variants grow exponentially with the number of genes, which they tackle by restricting the maximum number of regulators for each gene. Relaxing this restriction remains a challenge as the actual number of regulators is not known a priori.\n\nReproducibilityThe datasets and results can be found at: https://github.com/aaiitg-grp/TGS. This manuscript is currently under review. As soon as it is accepted, the source code will be made available at the same link. There are mentions of a supplementary document throughout the text. The supplementary document will also be made available after acceptance of the manuscript. If you wish to be notified when the supplementary document and source code are available, kindly send an email to saptarshipyne01@gmail.com with subject line TGS Source Code: Request for Notification. The email body can be kept blank.
- Citations
- 6
- FWCI
- 0.36
- Field percentile
- top 44%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Rapid Reconstruction of Time-varying Gene Regulatory Networks with Limited Main Memory
Saptarshi Pyne, Ashish Anand·IEEE Transactions on Computational Biology and BioinformaticsPeer-reviewed·Oct 11, 2019
- A Scalable Algorithm for Structure Identification of Complex Gene Regulatory Network from Temporal Expression Data
Shupeng Gui, Rui Chen, … Hongyu Miao·BMC BioinformaticsPeer-reviewed·Jan 31, 2017
- A Novel Algorithm for the Maximal Fit Problem in Boolean Networks
Guy Karlebach·bioRxiv·Jun 20, 2016
- Reconstruction of Gene Regulatory Networks based on Repairing Sparse Low-rank Matrices
Young Hwan Chang, Roel Dobbe, … Claire J. Tomlin·IEEE/ACM Transactions on Computational Biology and BioinformaticsPeer-reviewed·Jul 1, 2016
- KBoost: a new method to infer gene regulatory networks from gene expression data
Luis Fernando Iglesias-Martinez, Barbara De Kegel, Walter Kölch·Scientific ReportsPeer-reviewed·Jul 29, 2021
- GRNUlar: Gene Regulatory Network reconstruction using Unrolled algorithm from Single Cell RNA-Sequencing data
Harsh Shrivastava, Xiuwei Zhang, … Le Song·bioRxiv·Apr 23, 2020