Chaotic systems is widely employed in image encryption on account of its momentous properties including nonperiodicity, ergodicity, randomness and initial state sensitivity. However, some chaos-based cryptosystems sti...
详细信息
the surge in demand for cost-effective long-term archival media, coupled with density limitations of contemporary magnetic media, has resulted in synthetic dna emerging as a promising new alternative. Despite its bene...
详细信息
ISBN:
(纸本)9798400711817
the surge in demand for cost-effective long-term archival media, coupled with density limitations of contemporary magnetic media, has resulted in synthetic dna emerging as a promising new alternative. Despite its benefits, storing data in dna poses several challenges as the technology used for reading/writing data on dna are highly error prone. thus, it is important to design pipelines that can efficiently use redundancy to mask errors without amplifying read/write cost. In this work, we present Columnar molecular Storage System (CMOSS), a novel, end-to-end dna storage pipeline that can provide error-tolerant data storage at low read/write costs. CMOSS differs from state-of-the-art (SOTA) on three fronts (i) a motif-based, vertical layout in contrast to nucleotidebased horizontal layout, (ii) integrated consensus calling and decoding enabled by the vertical layout, and (iii) a flexible, block-based data organization for random access over dna storage in contrast to object-based organization. Using an in-depth evaluation with several simulated and real wet lab experiments, we demonstrate the benefits of CMOSS design.
We consider the problem of finding, for a given 2D pattern of colored tiles, a minimal set of tile types self-assembling to this pattern in the abstract Tile Assembly Model of Winfree (1998). this Patterned self-Assem...
详细信息
ISBN:
(纸本)9783642236372;9783642236389
We consider the problem of finding, for a given 2D pattern of colored tiles, a minimal set of tile types self-assembling to this pattern in the abstract Tile Assembly Model of Winfree (1998). this Patterned self-Assembly Tile set Synthesis (PATS) problem was first introduced by Ma and Lombardi (2008), and subsequently studied by Goos and Orponen (2011), who presented an exhaustive partition-search branch-and-bound algorithm (briefly PS-BB) for it. However, finding the true minimal tile sets is very time consuming, and PS-BB is not well-suited for finding small but not necessarily minimal solutions. In this paper, we modify the basic partition-search framework by using a heuristic to optimize the order in which the algorithm traverses its search space. We find that by running several parallel instances of the modified algorithm PS-H, the search time for small tile sets can be shortened considerably. We also introduce a method for computingthe reliability of a tile set, i.e. the probability of its error-free self-assembly to the target tiling, based on Winfree's analysis of the kinetic Tile Assembly Model (1998). We present data on the reliability of tile sets found by the algorithms and find that also here PS-H constitutes a significant improvement over PS-BB.
High throughput detection of multiple dna targets has become a widely used technique in molecular diagnostics. However, due to the limited surface in dense microreactor array microchip, it is impossible to attach a la...
详细信息
this paper proposes how to use self-assembly of dna tiles to calculate integer power over finite field GF(2n) with less assembly processing time. Two key functional components accomplish the computing process. One of ...
详细信息
ISBN:
(纸本)9781538666142
this paper proposes how to use self-assembly of dna tiles to calculate integer power over finite field GF(2n) with less assembly processing time. Two key functional components accomplish the computing process. One of them computes modular-multiplication and modularsquare in parallel, and the other one calculates modularsquare and transmits intermediate result. It achieves better performance than previous work for its optimized assembly rules. this tile assembly model requires 5316 types of computation tiles and 12 types of boundary tiles.
We introduce the problem of staged self-assembly of one-dimensional nanostructures, which becomes interesting when the elements are labeled (e.g., representing functional units that must be placed at specific location...
详细信息
ISBN:
(纸本)9783642236372
We introduce the problem of staged self-assembly of one-dimensional nanostructures, which becomes interesting when the elements are labeled (e.g., representing functional units that must be placed at specific locations). In a restricted model in which each operation has a single terminal assembly, we prove that assembling a given string of labels withthe fewest steps is equivalent, up to constant factors, to compressing the string to be uniquely derived from the smallest possible context-free grammar (a well-studied O(log n)-approximable problem) and that the problem is NP-hard. Without this restriction, we show that the optimal assembly can be substantially smaller than the optimal context-free grammar, by a factor of even for binary strings of length n. Fortunately, we can bound this separation in model power by a quadratic function in the number of distinct glues or tiles allowed in the assembly, which is typically small in practice.
An intermittent molecular encounter leading to a site-specific dna-break was unveiled under a limited protein's sliding-free condition. It reflects a transient molecular action by which the reaction rate and effic...
详细信息
ISBN:
(纸本)9781632666246
An intermittent molecular encounter leading to a site-specific dna-break was unveiled under a limited protein's sliding-free condition. It reflects a transient molecular action by which the reaction rate and efficiency of restriction enzyme in bacterial cells is enhanced. this was experimentally verified for the first time in the world by using our microfluidic device.
暂无评论