bioRxiv Science⌕ Search
Home/Archive/bioRxiv

bioRxiv · 10.1101/2020.09.16.300186

Reconstruction Algorithms for DNA-Storage Systems

Sabary, O.·Yucovich, A.·Shapira, G.·Yaakobi, E.
View original source ↗Export metadata ↓

Abstract

In the trace reconstruction problem a length-n string x yields a collection of noisy copies, called traces, y1, ..., yt where each yi is independently obtained from x by passing through a deletion channel, which deletes every symbol with some fixed probability. The main goal under this paradigm is to determine the required minimum number of i.i.d traces in order to reconstruct x with high probability. The trace reconstruction problem can be extended to the model where each trace is a result of x passing through a deletion-insertion-substitution channel, which introduces also insertions and substitutions. Motivated by the storage channel of DNA, this work is focused on another variation of the trace reconstruction problem, which is referred by the DNA reconstruction problem. A DNA reconstruction algorithm is a mapping [Formula] which receives t traces y1, ..., yt as an input and produces [Formula], an estimation of x. The goal in the DNA reconstruction problem is to minimize the edit distance [Formula] between the original string and the algorithms estimation. For the deletion channel case, the problem is referred by the deletion DNA reconstruction problem and the goal is to minimize the Levenshtein distance [Formula]. In this work, we present several new algorithms for these reconstruction problems. Our algorithms look globally on the entire sequence of the traces and use dynamic programming algorithms, which are used for the shortest common supersequence and the longest common subsequence problems, in order to decode the original sequence. Our algorithms do not require any limitations on the input and the number of traces, and more than that, they perform well even for error probabilities as high as 0.27. The algorithms have been tested on simulated data as well as on data from previous DNA experiments and are shown to outperform all previous algorithms.

Source connections

Explore related subjects

bioinformaticsPreprint

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sabary, O., Yucovich, A., Shapira, G., Yaakobi, E.. 2020-09-17. Reconstruction Algorithms for DNA-Storage Systems. https://doi.org/10.1101/2020.09.16.300186

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

bioRxiv2026

StableProt: Structure-Aware Deep Learning for Protein Thermostability (Tm) and Environmental Adaptation (OGT) Prediction

Predicting protein melting temperature (Tm) and organismal optimal growth temperature (OGT) is essential for enzyme engineering, biocatalyst design, and metagenomic bioprospecting, yet computational prediction faces several fundamental bottlenecks: sequence-only representations miss tertiary packing; dual-task coupling induces destructive gradient conflict; natural database skew (>87% mesophiles) drives mesophilic collapse; and existing tools produce uncalibrated point predictions. To address these challenges, we present StableProt, a structure-aware framework that couples amino acid sequences with Foldseek 3Di structural tokens via a frozen SaProt backbone to capture 3D contacts. Disjoint heads condition thermodynamic stability on ecological context without gradient conflict, while targeted 14% mesophilic subsampling expands thermophile representation to eliminate mesophilic collapse. Calibrated ensemble modeling reduces calibration error to 1.92%, providing dependable 95% confidence intervals. Evaluating models across 10{degrees}C temperature intervals reveals severe baseline collapse at thermal extremes, whereas StableProt maintains robust accuracy across regimes. On ProThermDB and zero-shot FireProtDB, StableProt achieves state-of-the-art probabilistic accuracy (CRPS = 4.52{degrees}C and 8.71{degrees}C) while recovering 92.0% of hyperthermophiles ([≥]80{degrees}C), and in prospective validation, its calibrated intervals capture both enzyme stability (75.3% coverage) and host environmental growth temperatures (78.1% coverage). StableProt is freely accessible as an interactive web server at https://stableprot.dixitlab.org/.

bioinformatics↗
bioRxiv2026

RoDPAA: A Robust Dissimilarity-Based Principal Angle Analysis Framework for Multi-View Microbiome Data Integration

Multiview microbiome studies profile the same participants across body sites or molecular layers, but integration is hampered by sparse, compositional data, modest sample sizes and methods that recognize only exact sharing. We present RoDPAA (Robust Dissimilarity-based Principal Angle Analysis), a framework that represents each view through any data-appropriate dissimilarity, such as Bray--Curtis, without log-ratio transformation or likelihood assumptions. RoDPAA aligns view-specific signal subspaces through principal angles, captures complete and partial sharing, and tests by permutation how many components are shared, using only eigendecomposition and little tuning. In Gaussian simulations, RoDPAA matched JIVE and MOFA given true ranks, ran faster and alone recovered the shared dimension in every replicate. In two inflammatory bowel disease (IBD) cohorts with sparse, zero-inflated data, Bray--Curtis-based RoDPAA recovered shared structure that was stable to prevalence filtering, whereas log-ratio-based alternatives were not. Its leading microbiome--metabolome factors, learned without disease labels, were the only ones associated with IBD.

bioinformatics↗
bioRxiv2026

Deducing splicing events from transcript sets with splicelogic

Long-read RNA sequencing captures a greater proportion of full-length transcripts, enabling more accurate isoform identification, discovery of novel isoforms, and more precise differential transcript usage analysis. However, comparing transcripts, whether between conditions or between sets such as novel and annotated isoforms, yields complex isoform changes that are hard to manipulate, summarize, and visualize. This is compounded by vertical integration of some tools, where downstream analysis depends on the specific output of a particular upstream tool. To address this gap, we have developed splicelogic, an R/Bioconductor package that makes transcript-set comparisons biologically interpretable by turning them into discrete splicing events, such as exon skipping, alternative splice sites, intron retention, and alternative transcription start and end sites. We designed splicelogic to integrate easily with existing RNA-seq workflows and tools. The splicelogic functions are modular, readable, and extensible, making it easy for users to adapt core logic to their own custom scientific questions or novel splicing definitions. By obtaining interpretable splicing events from transcript changes, splicelogic enables downstream analyses, including annotation of RNA-binding protein recognition sites, alongside summary statistics and visualization. The splicelogic package is publicly available and distributed through Bioconductor.

bioinformatics↗