Fully scalable online-preprocessing algorithm for short oligonucleotide microarray atlases
Leo Lahti, Aurora Torrente, Laura L. Elo, Alvis Brazma, Johan Rung

TL;DR
This paper introduces a fully scalable online-learning algorithm for preprocessing short oligonucleotide microarray data, enabling efficient analysis of large collections without extensive memory use, applicable across platforms.
Contribution
The authors present a novel online-learning algorithm that scales linearly with data size, allowing probe-level preprocessing for microarrays on a large scale, unlike previous methods.
Findings
Scales linearly with sample size
Applicable to all short oligonucleotide platforms
Enables processing of tens of thousands of arrays
Abstract
Accumulation of standardized data collections is opening up novel opportunities for holistic characterization of genome function. The limited scalability of current preprocessing techniques has, however, formed a bottleneck for full utilization of contemporary microarray collections. While short oligonucleotide arrays constitute a major source of genome-wide profiling data, scalable probe-level preprocessing algorithms have been available only for few measurement platforms based on pre-calculated model parameters from restricted reference training sets. To overcome these key limitations, we introduce a fully scalable online-learning algorithm that provides tools to process large microarray atlases including tens of thousands of arrays. Unlike the alternatives, the proposed algorithm scales up in linear time with respect to sample size and is readily applicable to all short…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
