Abstract
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.ReproducibilityThe 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.
Publisher
Cold Spring Harbor Laboratory
Reference43 articles.
1. N. Friedman , K. Murphy , and S. Russell , “Learning the structure of dynamic probabilistic networks,” in Proceedings of the Fourteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-98), San Francisco, CA, 1998, pp. 139–147.
2. Non-stationary dynamic bayesian networks;Advances in Neural Information Processing Systems,2008
3. Non-stationary continuous dynamic bayesian networks;Advances in Neural Information Processing Systems,2009
4. Statistical inference of the time-varying structure of gene-regulation networks;BMC Systems Biology,2010
5. Non-homogeneous dynamic bayesian networks with bayesian regularization for inferring gene regulatory networks with gradually time-varying structure;Machine Learning,2013