Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Saptarshi Pyne [aut, cre] (<https://orcid.org/0000-0001-9710-6749>), Manan Gupta [aut], Alok Kumar [aut], Ashish Anand [aut] (<https://orcid.org/0000-0002-0024-3358>) |
| Bioconductor views | GeneExpression GraphAndNetwork Microarray Network NetworkInference Software SystemsBiology |
| Maintainer | Saptarshi Pyne <saptarshipyne01@gmail.com> |
| License | CC BY-NC-SA 4.0 |
| Version | 1.0.1 |
| URL | https://www.biorxiv.org/content/early/2018/06/14/272484 https://github.com/sap01/TGS |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the TGS package in your browser
Any scripts or data that you put into this service are public.
