Saptarshi Pyne

Saptarshi Pyne

Auto-generated profile, based on publicly available information

Saptarshi Pyne

Indian Institute of Technology Guwahati

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 July 2018 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
SPSaptarshi Pyne
Saptarshi Pyne
AKAlok Ranjan Kumar
Alok Ranjan Kumar
AAAshish Anand
Ashish Anand
Rapid advancements in high-throughput technologies have 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; and 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, the 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.


13 May 2023 in bioRxiv
Verified
Preprint
Open access
PDF file
CCCristobal Carrera Carriel
Cristobal Carrera Carriel
SPSaptarshi Pyne
Saptarshi Pyne
SHSpencer A. Halberg-Spencer
Spencer A. Halberg-Spencer
SPSung Chul Park
Sung Chul Park
HSHye-won Seo
Hye-won Seo
SRSushmita Roy
Sushmita Roy
Aspergillus fumigatus is a notorious pathogenic fungus responsible for various harmful, sometimes lethal, diseases known as aspergilloses. Understanding the gene regulatory networks that specify the expression programs underlying this fungus’ diverse phenotypes can shed mechanistic insight into its growth, development, and determinants of pathogenicity. We used eighteen RNA-seq datasets (seventeen publicly available and one previously unpublished) of Aspergillus fumigatus to construct a comprehensive gene regulatory network resource. Our resource, named GRAsp ( G ene R egulation of Asp ergillus fumigatus ), was able to recapitulate known regulatory pathways such as response to hypoxia, iron and zinc homeostasis, and secondary metabolite synthesis. Further, GRAsp was experimentally validated in two cases: one in which GRAsp accurately identified an uncharacterized transcription factor negatively regulating the production of the virulence factor gliotoxin and another where GRAsp revealed the bZip protein, AtfA, as required for fungal responses to microbial signals known as lipo-chitooligosaccharides. Our work showcases the strength of using network-based approaches to generate new hypotheses about regulatory relationships in Aspergillus fumigatus . We also unveil an online, user-friendly version of GRAsp available to the Aspergillus research community.

16 November 2018
Verified
Dataset
Open access
SPSaptarshi Pyne
Saptarshi Pyne
MGManan Gupta
Manan Gupta
AKAlok Kumar
Alok Kumar
AAAshish Anand
Ashish Anand

11 October 2019 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
SPSaptarshi Pyne
Saptarshi Pyne
AAAshish Anand
Ashish Anand
Reconstruction of time-varying gene regulatory networks underlying a time-series gene expression data is a fundamental challenge in the computational systems biology. The challenge increases multi-fold if the target networks need to be constructed for hundreds to thousands of genes. There have been constant efforts to design an algorithm that can perform the reconstruction task correctly as well as can scale efficiently (with respect to both time and memory) to such a large number of genes. However, the existing algorithms either do not offer time-efficiency, or they offer it at other costs - memory-inefficiency or imposition of a constraint, known as the 'smoothly time-varying assumption'. In this article, two novel algorithms - 'an algorithm for reconstructing Time-varying Gene regulatory networks with Shortlisted candidate regulators - which is Light on memory' (TGS-Lite) and 'TGS-Lite Plus' (TGS-Lite+) - are proposed that are time-efficient, memory-efficient and do not impose the smoothly time-varying assumption. Additionally, they offer state-of-the-art reconstruction correctness as demonstrated with three benchmark datasets. Source Code: https://github.com/sap01/TGS-Lite-supplem/tree/master/sourcecode.

5 September 2019 in bioRxiv
Verified
Preprint
Open access
PDF file
SPSaptarshi Pyne
Saptarshi Pyne
AAAshish Anand
Ashish Anand
Reconstruction of time-varying gene regulatory networks underlying a time-series gene expression data is a fundamental challenge in the computational systems biology. The challenge increases multi-fold if the target networks need to be constructed for hundreds to thousands of genes. There have been constant efforts to design an algorithm that can perform the reconstruction task correctly as well as can scale efficiently (with respect to both time and memory) to such a large number of genes. However, the existing algorithms either do not offer time-efficiency, or they offer it at other costs – memory-inefficiency or imposition of a constraint, known as the ‘smoothly time-varying assumption’. In this paper, two novel algorithms – ‘an algorithm for reconstructing Time-varying Gene regulatory networks with Shortlisted candidate regulators - which is Light on memory’ ( TGS-Lite ) and ‘TGS-Lite Plus’ ( TGS-Lite+ ) – are proposed that are time-efficient, memory-efficient and do not impose the smoothly time-varying assumption. Additionally, they offer state-of-the-art reconstruction correctness as demonstrated with three benchmark datasets. Source Code: https://github.com/sap01/TGS-Lite-supplem/tree/master/sourcecode