Show simple item record

dc.contributor.authorDeMeo, Benjamin
dc.contributor.authorBerger, Bonnie
dc.date.accessioned2022-09-27T18:42:27Z
dc.date.available2022-09-27T18:42:27Z
dc.date.issued2020
dc.identifier.urihttps://hdl.handle.net/1721.1/145594
dc.description.abstract<jats:title>Abstract</jats:title> <jats:sec> <jats:title>Motivation</jats:title> <jats:p>Single-cell RNA-sequencing has grown massively in scale since its inception, presenting substantial analytic and computational challenges. Even simple downstream analyses, such as dimensionality reduction and clustering, require days of runtime and hundreds of gigabytes of memory for today’s largest datasets. In addition, current methods often favor common cell types, and miss salient biological features captured by small cell populations.</jats:p> </jats:sec> <jats:sec> <jats:title>Results</jats:title> <jats:p>Here we present Hopper, a single-cell toolkit that both speeds up the analysis of single-cell datasets and highlights their transcriptional diversity by intelligent subsampling, or sketching. Hopper realizes the optimal polynomial-time approximation of the Hausdorff distance between the full and downsampled dataset, ensuring that each cell is well-represented by some cell in the sample. Unlike prior sketching methods, Hopper adds points iteratively and allows for additional sampling from regions of interest, enabling fast and targeted multi-resolution analyses. In a dataset of over 1.3 million mouse brain cells, Hopper detects a cluster of just 64 macrophages expressing inflammatory genes (0.004% of the full dataset) from a Hopper sketch containing just 5000 cells, and several other small but biologically interesting immune cell populations invisible to analysis of the full data. On an even larger dataset consisting of ∼2 million developing mouse organ cells, we show Hopper’s even representation of important cell types in small sketches, in contrast with prior sketching methods. We also introduce Treehopper, which uses spatial partitioning to speed up Hopper by orders of magnitude with minimal loss in performance. By condensing transcriptional information encoded in large datasets, Hopper and Treehopper grant the individual user with a laptop the analytic capabilities of a large consortium.</jats:p> </jats:sec> <jats:sec> <jats:title>Availability and implementation</jats:title> <jats:p>The code for Hopper is available at https://github.com/bendemeo/hopper. In addition, we have provided sketches of many of the largest single-cell datasets, available at http://hopper.csail.mit.edu.</jats:p> </jats:sec>en_US
dc.language.isoen
dc.publisherOxford University Press (OUP)en_US
dc.relation.isversionof10.1093/BIOINFORMATICS/BTAA408en_US
dc.rightsCreative Commons Attribution NonCommercial License 4.0en_US
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/en_US
dc.sourceOxford University Pressen_US
dc.titleHopper: a mathematically optimal algorithm for sketching biological dataen_US
dc.typeArticleen_US
dc.identifier.citationDeMeo, Benjamin and Berger, Bonnie. 2020. "Hopper: a mathematically optimal algorithm for sketching biological data." Bioinformatics, 36 (Supplement_1).
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.relation.journalBioinformaticsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-09-27T18:31:29Z
dspace.orderedauthorsDeMeo, B; Berger, Ben_US
dspace.date.submission2022-09-27T18:31:30Z
mit.journal.volume36en_US
mit.journal.issueSupplement_1en_US
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record