Back

Design and Assembly of Combinatorial DNA Barcodes for Probe-based Genomics Applications

Goode, Z.; Tiedemann, E.; Ben Ameur, L.; Pavan, K.; Young, K.; Sek, M.; Nevue, A.; Zhu, J.; Houghton, J.; Fu, Y.; Boisvert, H.; Saunders, A.

2026-08-26 genomics
10.64898/2026.08.22.746475 bioRxiv
Show abstract

Probe-based genomics technologies are extending molecular analysis into intact tissues and fixed cells, yet strategies to decode complex experimental conditions encoded in cellular RNA remain limited. Here we present a modular framework that integrates custom software tools with purpose-built cloning reagents to design, assemble, validate, and deploy combinatorial DNA barcodes. Combinatorial barcodes comprise spatially adjacent collections of known sequences, enabling millions of unique molecules to be efficiently distinguished using a limited set of probes. Our software tools integrate with optimized assembly plasmids and whole plasmid long-read sequencing for high-fidelity construction and structural validation of diverse combinatorial barcode architectures. Assembled barcode libraries are flexibly transferred into user-modified expression vectors to support diverse downstream experimental applications. We showcase the versatility of this framework by assembling two structurally distinct combinatorial barcode libraries, each containing millions of unique sequences. Following rabies virus-based delivery to the mouse brain, we validate in vivo decoding of a combinatorial barcode architecture capable of distinguishing ~16.3 million expressed RNAs through probe-based in situ sequencing. Our framework for flexible and accurate combinatorial barcode construction fills a technically demanding niche delivering cost-effective molecular reagents for multiplexed experimentation on current and evolving probe-based genomics platforms.

Matching journals

The top 3 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.