Manoj Gopalkrishnan

Dr. Manoj Gopalkrishnan


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
16 September 2015 in Bulletin of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
DADavid F. Anderson
David F. Anderson
GCGheorghe Craciun
Gheorghe Craciun
MGManoj Gopalkrishnan
Manoj Gopalkrishnan
CWCarsten Wiuf
Carsten Wiuf

27 April 2021 in IEEE Open Journal of Signal Processing
Verified
Journal Article
Open access
SGSabyasachi Ghosh
Sabyasachi Ghosh
RARishi Agarwal
Rishi Agarwal
MRMohammad Ali Rehan
Mohammad Ali Rehan
SPShreya Pathak
Shreya Pathak
PAPratyush Agarwal
Pratyush Agarwal
MGManoj Gopalkrishnan
Manoj Gopalkrishnan
We propose ‘Tapestry’, a single-round pooled testing method with application to COVID-19 testing using quantitative Reverse Transcription Polymerase Chain Reaction (RT-PCR) that can result in shorter testing time and conservation of reagents and testing kits, at clinically acceptable false positive or false negative rates. Tapestry combines ideas from compressed sensing and combinatorial group testing to create a new kind of algorithm that is very effective in deconvoluting pooled tests. Unlike Boolean group testing algorithms, the input is a quantitative readout from each test and the output is a list of viral loads for each sample relative to the pool with the highest viral load. For guaranteed recovery of $k$ infected samples out of $n \gg k$ being tested, Tapestry needs only $O(k \log n)$ tests with high probability, using random binary pooling matrices. However, we propose deterministic binary pooling matrices based on combinatorial design ideas of Kirkman Triple Systems, which balance between good reconstruction properties and matrix sparsity for ease of pooling while requiring fewer tests in practice. This enables large savings using Tapestry at low prevalence rates while maintaining viability at prevalence rates as high as 9.5%. Empirically we find that single-round Tapestry pooling improves over two-round Dorfman pooling by almost a factor of 2 in the number of tests required. We evaluate Tapestry in simulations with synthetic data obtained using a novel noise model for RT-PCR, and validate it in wet lab experiments with oligomers in quantitative RT-PCR assays. Lastly, we describe use-case scenarios for deployment.

29 April 2020 in medRxiv
Verified
Preprint
Open access
PDF file
SGSabyasachi Ghosh
Sabyasachi Ghosh
ARAjit Rajwade
Ajit Rajwade
SKSrikar Krishna
Srikar Krishna
NGNikhil Gopalkrishnan
Nikhil Gopalkrishnan
TSThomas E. Schaus
Thomas E. Schaus
MGManoj Gopalkrishnan
Manoj Gopalkrishnan
The COVID-19 pandemic has strained testing capabilities worldwide. There is an urgent need to find economical and scalable ways to test more people. We present Tapestry , a novel quantitative nonadaptive pooling scheme to test many samples using only a few tests. The underlying molecular diagnostic test is any real-time RT-PCR diagnostic panel approved for the detection of the SARS-CoV-2 virus. In cases where most samples are negative for the virus, Tapestry accurately identifies the status of each individual sample with a single round of testing in fewer tests than simple two-round pooling. We also present a companion Android application BYOM Smart Testing which guides users through the pipetting steps required to perform the combinatorial pooling. The results of the pooled tests can be fed into the application to recover the status and estimated viral load for each individual sample. NOTE: This protocol has been validated with in vitro experiments that used synthetic RNA and DNA fragments and additionally, its expected behavior has been confirmed using computer simulations. Validation with clinical samples is ongoing. We are looking for clinical collaborators with access to patient samples. Please contact the corresponding author if you wish to validate this protocol on clinical samples.

24 August 2017
Verified
Book Chapter
Open access
PDF file
WPWilliam Poole
William Poole
AOAndrés Ortiz-Muñoz
Andrés Ortiz-Muñoz
ABAbhishek Behera
Abhishek Behera
NJNick S. Jones
Nick S. Jones
TOThomas E. Ouldridge
Thomas E. Ouldridge
MGManoj Gopalkrishnan
Manoj Gopalkrishnan
How smart can a micron-sized bag of chemicals be? How can an artificial or real cell make inferences about its environment? From which kinds of probability distributions can chemical reaction networks sample? We begin tackling these questions by showing three ways in which a stochastic chemical reaction network can implement a Boltzmann machine, a stochastic neural network model that can generate a wide range of probability distributions and compute conditional probabilities. The resulting models, and the associated theorems, provide a road map for constructing chemical reaction networks that exploit their native stochasticity as a computational resource. Finally, to show the potential of our models, we simulate a chemical Boltzmann machine to classify and generate MNIST digits in-silico.

23 September 2014 in Bulletin of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
ADAbhishek Deshpande
Abhishek Deshpande
MGManoj Gopalkrishnan
Manoj Gopalkrishnan