Structure learning for zero-inflated counts, with an application to single-cell RNA sequencing data
Not on the map. Why?
Abstract (arXiv)
The problem of estimating the structure of a graph from observed data is of growing interest in the context of high-throughput genomic data, and single-cell RNA sequencing in particular. These, however, are challenging applications, since the data consist of high-dimensional counts with high variance and over-abundance of zeros. Here, we present a general framework for learning the structure of a graph from single-cell RNA-seq data, based on the zero-inflated negative binomial distribution. We demonstrate with simulations that our approach is able to retrieve the structure of a graph in a variety of settings and we show the utility of the approach on real data.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Testing hypotheses via orthogonalizationcited by 0
- 2026Testing hypotheses via orthogonalization29 Jun 2026