Abstract
AbstractWith 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 new techniques and algorithms? In this paper, we examine some DNA algorithms that assume high-throughput synthesis and sequencing. We record the order in which N events occur, using $$N^2$$
N
2
redundant detectors but only N distinct DNA domains, and (after sequencing) reconstruct the order by transitive reduction.
Publisher
Springer Nature Singapore