TGS: Rapid Reconstruction of Time-Varying Gene Regulatory Networks

Rapid advancements in high-throughput gene sequencing technologies have resulted in genome-scale time-series datasets. Uncovering the underlying temporal sequence of gene regulatory events in the form of time-varying gene regulatory networks demands accurate and computationally efficient algorithms. Such an algorithm is 'TGS'. It is proposed in Saptarshi Pyne, Alok Ranjan Kumar, and Ashish Anand. Rapid reconstruction of time-varying gene regulatory networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 17(1):278{291, Jan-Feb 2020. The TGS algorithm is shown to consume only 29 minutes for a microarray dataset with 4028 genes. This package provides an implementation of the TGS algorithm and its variants.

Version: 1.0.1
Imports: rjson, bnstruct, ggm, foreach, doParallel, minet (≥ 3.38.0)
Suggests: R.rsp, testthat (≥ 2.1.0), knitr, rmarkdown
Published: 2020-05-07
DOI: 10.32614/CRAN.package.TGS
Author: Saptarshi Pyne ORCID iD [aut, cre], Manan Gupta [aut], Alok Kumar [aut], Ashish Anand ORCID iD [aut]
Maintainer: Saptarshi Pyne <saptarshipyne01 at>
License: CC BY-NC-SA 4.0
NeedsCompilation: no
Materials: README NEWS
In views: Omics
CRAN checks: TGS results


Reference manual: TGS.pdf
Vignettes: Chap 1: A Quick Start Guide


Package source: TGS_1.0.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): TGS_1.0.1.tgz, r-oldrel (arm64): TGS_1.0.1.tgz, r-release (x86_64): TGS_1.0.1.tgz, r-oldrel (x86_64): TGS_1.0.1.tgz
Old sources: TGS archive


Please use the canonical form to link to this page.