English
Related papers

Related papers: On Counting Subsequences and Higher-Order Fibonacc…

200 papers

The synthesis of DNA strands remains the most costly part of the DNA storage system. Thus, to make DNA storage system more practical, the time and materials used in the synthesis process have to be optimized. We consider the most common…

Information Theory · Computer Science 2023-05-15 Johan Chrisnata , Han Mao Kiah , Van Long Phuoc Pham

DNA synthesis is considered as one of the most expensive components in current DNA storage systems. In this paper, focusing on a common synthesis machine, which generates multiple DNA strands in parallel following a fixed supersequence,we…

Information Theory · Computer Science 2025-05-13 Yajuan Liu , Tolga M. Duman

In the recent years, DNA has emerged as a potentially viable storage technology. DNA synthesis, which refers to the task of writing the data into DNA, is perhaps the most costly part of existing storage systems. Accordingly, this high cost…

Information Theory · Computer Science 2022-04-15 Ohad Elishco , Wasim Huleihel

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

Combinatorics · Mathematics 2026-04-28 Zixian Yang , Jianchao Bai

Motivated by DNA based data storage system, we investigate the errors that occur when synthesizing DNA strands in parallel, where each strand is appended one nucleotide at a time by the machine according to a template supersequence. If…

Information Theory · Computer Science 2024-05-06 Ziyang Lu , Han Mao Kiah , Yiwei Zhang , Robert N. Grass , Eitan Yaakobi

This paper presents a probabilistic approach for DNA sequence analysis. A DNA sequence consists of an arrangement of the four nucleotides A, C, T and G and different representation schemes are presented according to a probability measure…

Quantitative Methods · Quantitative Biology 2010-02-12 Amrita Priyam , B. M. Karan , G. Sahoo

This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous…

Information Theory · Computer Science 2023-04-21 Yonatan Yehezkeally , Daniella Bar-Lev , Sagi Marcovich , Eitan Yaakobi

DNA-based storage offers unprecedented density and durability, but its scalability is fundamentally limited by the efficiency of parallel strand synthesis. Existing methods either allow unconstrained nucleotide additions to individual…

Information Theory · Computer Science 2025-10-27 Boaz Moav , Ryan Gabrys , Eitan Yaakobi

We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…

General Mathematics · Mathematics 2015-02-25 Masum Billal

DNA sequences are prone to creating secondary structures by folding back on themselves by non-specific hybridization among its nucleotides. The formation of secondary structures makes the sequences chemically inactive towards synthesis and…

Information Theory · Computer Science 2022-11-30 Siddhartha Siddhiprada Bhoi , Paramapalli Udaya , Abhay Kumar Singh

This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous…

Information Theory · Computer Science 2022-05-10 Yonatan Yehezkeally , Daniella Bar-Lev , Sagi Marcovich , Eitan Yaakobi

Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…

Probability · Mathematics 2016-09-26 S. Amsalu , C. Houdré , H. Matzinger

DNA sequencing is the basic workhorse of modern day biology and medicine. Shotgun sequencing is the dominant technique used: many randomly located short fragments called reads are extracted from the DNA sequence, and these reads are…

Information Theory · Computer Science 2013-02-15 Abolfazl Motahari , Guy Bresler , David Tse

We study the theoretical problem of synthesizing multiple DNA strands under spatial constraints, motivated by large-scale DNA synthesis technologies. In this setting, strands are arranged in an array and synthesized according to a fixed…

Information Theory · Computer Science 2026-01-14 Boaz Moav , Ryan Gabrys , Eitan Yaakobi

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

Number Theory · Mathematics 2025-01-08 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

Large pools of synthetic DNA molecules have been recently used to reliably store significant volumes of digital data. While DNA as a storage medium has enormous potential because of its high storage density, its practical use is currently…

Data Structures and Algorithms · Computer Science 2021-02-25 Konstantin Makarychev , Miklos Z. Racz , Cyrus Rashtchian , Sergey Yekhanin

Composite DNA is a recent method to increase the base alphabet size in DNA-based data storage.This paper models synthesizing and sequencing of composite DNA and introduces coding techniques to correct substitutions, losses of entire…

Information Theory · Computer Science 2025-10-29 Frederik Walter , Omer Sabary , Antonia Wachter-Zeh , Eitan Yaakobi

The prevalent technique for DNA sequencing consists of two main steps: shotgun sequencing, where many randomly located fragments, called reads, are extracted from the overall sequence, followed by an assembly algorithm that aims to…

Genomics · Quantitative Biology 2016-01-28 Shirshendu Ganguly , Elchanan Mossel , Miklos Z. Racz

With recent high-throughput technology we can synthesize large heterogeneous collections of DNA structures, and also read them all out precisely in a single procedure. Can we use these tools, not only to do things faster, but also to devise…

Data Structures and Algorithms · Computer Science 2021-12-07 Luca Cardelli

Traditionally, we usually utilize the method of shotgun to cut a DNA sequence into pieces and we have to reconstruct the original DNA sequence from the pieces, those are widely used method for DNA assembly. Emerging DNA sequence…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-04-15 Yukun Zhong , ZhiWei He , XianHong Wang , XiongBin Cao
‹ Prev 1 2 3 10 Next ›