Biology subjects

Yaakobi, E.

Publications and source records attributed to Yaakobi, E..

5 recordsLinked to original sources

bioRxiv2026

NinjaSeq: programmable restriction enzyme-based sequencing library preparation with random access for DNA data storage

DNA data storage allows sequences to be defined without biological constraints, yet readout workflows still depend on generic end-repair/dA-tailing chemistry. We developed NinjaSeq, a type IIS restriction endonuclease library-preparation strategy that incorporates recognition sites into primer flanks, enabling digestion to generate adapter-compatible overhangs and eliminating the need for conventional end preparation. By combining this chemistry with constrained coding that excludes internal recognition motifs, NinjaSeq produced sequencing quality and decoding performance consistent with standard protocols while reducing reagent burden and simplifying processing, including compatibility with one-pot restriction-ligation. The same sequence-directed design also enables physical random access during library preparation: targeting file-specific flanking sites enriched a desired file from a mixed pool by about sixteen-fold in a proof-of-concept experiment. These results position NinjaSeq as a practical ONT readout approach for DNA data storage. HIGHLIGHTSO_LINinjaSeq replaces end-repair/dA-tailing with REases for nanopore sequencing C_LIO_LIConstrained encoding excludes recognition motifs to protect payloads from cleavage C_LIO_LINinjaSeq achieves decoding accuracy comparable to standard library preparation C_LIO_LIDesigning file-specific RRS enables random access during library preparation C_LI

molecular biology↗

bioRxiv2023

GradHC: Highly Reliable Gradual Hash-based Clustering for DNA Storage Systems

As data storage challenges grow and existing technologies approach their limits, synthetic DNA emerges as a promising storage solution due to its remarkable density and durability advantages. While cost remains a concern, emerging sequencing and synthetic technologies aim to mitigate it, yet introduce challenges such as errors in the storage and retrieval process. One crucial in a DNA storage system is clustering numerous DNA reads into groups that represent the original input strands. In this paper, we review different methods for evaluating clustering algorithms and introduce a novel clustering algorithm for DNA storage systems, named Gradual Hash-based clustering (GradHC). The primary strength of GradHC lies in its capability to cluster with excellent accuracy various types of designs, including varying strand lengths, cluster sizes (including extremely small clusters), and different error ranges. Benchmark analysis demonstrates that GradHC is significantly more stable and robust than other clustering algorithms previously proposed for DNA storage, while also producing highly reliable clustering results.

bioinformatics↗

bioRxiv2023

Design of optimal labeling patterns for optical genome mapping via information theory

Optical genome mapping (OGM) is a technique that extracts partial genomic information from optically imaged and linearized DNA fragments containing fluorescently labeled short sequence patterns. This information can be used for various genomic analyses and applications, such as the detection of structural variations and copy-number variations, epigenomic profiling, and microbial species identification. Currently, the choice of labeled patterns is based on the available bio-chemical methods, and is not necessarily optimized for the application. In this work, we develop a model of OGM based on information theory, which enables the design of optimal labeling patterns for specific applications and target organism genomes. We validated the model through experimental OGM on human DNA and simulations on bacterial DNA. Our model predicts up to 10-fold improved accuracy by optimal choice of labeling patterns, which may guide future development of OGM bio-chemical labeling methods and significantly improve its accuracy and yield for applications such as epigenomic profiling and cultivation-free pathogen identification in clinical samples.

bioinformatics↗

bioRxiv2020

Reconstruction Algorithms for DNA-Storage Systems

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.

bioinformatics↗

bioRxiv2019

SOLQC : Synthetic Oligo Library Quality Control Tool.

MotivationRecent years have seen a growing number and a broadening scope of studies using synthetic oligo libraries for a range of applications in synthetic biology. As experiments are growing by numbers and complexity, analysis tools can facilitate quality control and help in assessment and inference. ResultsWe present a novel analysis tool, called SOLQC, which enables fast and comprehensive analysis of synthetic oligo libraries, based on NGS analysis performed by the user. SOLQC provides statistical information such as the distribution of variant representation, different error rates and their dependence on sequence or library properties. SOLQC produces graphical descriptions of the analysis results. The results are reported in a flexible report format. We demonstrate SOLQC by analyzing literature libraries. We also discuss the potential benefits and relevance of the different components of the analysis. Availabilityhttps://app.gitbook.com/@yoav-orlev/s/solqc/

bioinformatics↗