the hybridization of complementary nucleic acid strands is the most basic of all reactions involving nucleic acids, but has a major limitation: the specificity of hybridization reactions depends critically on the leng...
详细信息
ISBN:
(纸本)9783642183041
the hybridization of complementary nucleic acid strands is the most basic of all reactions involving nucleic acids, but has a major limitation: the specificity of hybridization reactions depends critically on the lengths of the complementary pairs of strands and can drop to very low values for sufficiently long strands. this reduction in specificity occurs especially in the presence of noise in the form of other competing strands that have sequence segments identical to the target. this limits the scale and accuracy of biotechnology and nanotechnology applications which depend on hybridization reactions. Our paper develops techniques for ensuring specific high-fidelity dna hybridization reactions for target strands of arbitrary length. Our protocol is executed autonomously, without external mediation and driven by a series of conversions of single stranded dna into duplex dnathat help overcome kinetic energy traps, similar to dna walkers.
Algorithmic dna tile systems have the potential to allow the construction by self-assembly of large structures with complex nanometer-scale details out of relatively few monomer types, but are constrained by errors in...
详细信息
ISBN:
(数字)9783030000301
ISBN:
(纸本)9783030000301;9783030000295
Algorithmic dna tile systems have the potential to allow the construction by self-assembly of large structures with complex nanometer-scale details out of relatively few monomer types, but are constrained by errors in growth and the limited sequence space of orthogonal dna sticky ends that program tile interactions. We present a tile set optimization technique that, through analysis of algorithmic growth equivalence, potentially sensitive error pathways, and potential lattice defects, can significantly reduce the size of tile systems while preserving proofreading behavior that is essential for obtaining low error rates. Applied to systems implementing multiple algorithms that are far beyond the size of currently feasible implementations, the optimization technique results in systems that are comparable in size to already-implemented experimental systems.
dna nanomachines are assemblies that rely on molecular inputs that are processed or transduced into measurable outputs. though dna nanotechnology has created a gamut of molecular devices, an outstanding challenge has ...
详细信息
ISBN:
(纸本)9783642236372
dna nanomachines are assemblies that rely on molecular inputs that are processed or transduced into measurable outputs. though dna nanotechnology has created a gamut of molecular devices, an outstanding challenge has been the demonstration of functionality and relevance of these devices in living systems. the I-switch is a dna nanodevice that, in response to protons, changes its conformation to produce a fluorescence resonance energy transfer (FRET) signal. We show that this rationally designed molecular device is capable of measuring spatiotemporal pH changes associated with endosomes as they undergo maturation in living cells in culture. Furthermore, we show that the nanomachine retains its autonomous functionality as it maps the same biological process in cells of a living organism like C. elegans. this demonstration of the quantitative functionality of an artificially designed scaffold positions dna nanodevices as powerful tools to interrogate biological phenomena.
We present strand and codeword design schemes for a dna database capable of approximate similarity search over a multidimensional dataset of content-rich media. Our strand designs address crosstalk in associative dna ...
详细信息
ISBN:
(数字)9783030000301
ISBN:
(纸本)9783030000301;9783030000295
We present strand and codeword design schemes for a dna database capable of approximate similarity search over a multidimensional dataset of content-rich media. Our strand designs address crosstalk in associative dna databases, and we demonstrate a novel method for learning dna sequence encodings from data, applying it to a dataset of tens of thousands of images. We test our design in the wetlab using one hundred target images and ten query images, and show that our database is capable of performing similarity-based enrichment: on average, visually similar images account for 30% of the sequencing reads for each query, despite making up only 10% of the database.
Biological organisms are beautiful examples of programming. the program and data are stored in biological molecules such as dna, RNA, and proteins;the algorithms are carried out by molecular and biochemical processes;...
详细信息
the proceedings contains 47 papers on the applications of computing to natural sciences. Topics discussed include dna sequences, proteins, biology, data structures, databases, computer systems, algorithms, molecular s...
详细信息
ISBN:
(纸本)0818650907
the proceedings contains 47 papers on the applications of computing to natural sciences. Topics discussed include dna sequences, proteins, biology, data structures, databases, computer systems, algorithms, molecular structures, genomes, data reduction, drugs, computer programming, computer programming languages, user interfaces, computer graphics and systems analysis.
Biomolecularprogramming performs computing utilizing many sorts of reactions and stores the information in biological macromolecules (proteins and nucleic acids). dna (Deoxyribose Nucleic Acid) exhibits highly predic...
详细信息
A major challenge in practical dna tile self-assembly is the minimization of errors. Using the kinetic Tile Assembly Model, a theoretical model of self-assembly, it has been shown that errors can be reduced through ab...
详细信息
ISBN:
(纸本)9783319019284;9783319019277
A major challenge in practical dna tile self-assembly is the minimization of errors. Using the kinetic Tile Assembly Model, a theoretical model of self-assembly, it has been shown that errors can be reduced through abstract tile set design. In this paper, we instead investigate the effects of "sticky end" sequence choices in systems using the kinetic model along withthe nearest-neighbor model of dna interactions. We show that boththe sticky end sequences present in a system and their positions in the system can significantly affect error rates, and propose algorithms for sequence design and assignment.
K MapReduce (KMR) is a high-performance MapReduce system in the MPI environment, targeting large-scale supercomputers such as the K computer. Its objectives are to ease programming for data-processing and to achieve e...
详细信息
ISBN:
(纸本)9781479908981
K MapReduce (KMR) is a high-performance MapReduce system in the MPI environment, targeting large-scale supercomputers such as the K computer. Its objectives are to ease programming for data-processing and to achieve efficiency by utilizing the large amount of memory available in large-scale supercomputers. In KMR, shuffling operation exchanges key-value pairs in a scalable way by collective communication algorithms utilizing the K's interconnect. Mapping and reducing operations are multi-threaded to achieve even greater efficiency in modern multi-core machines. Sorting is optimized using fixed-length packed keys instead of variable-length raw keys, which is extensively used inside of shuffling and reducing operations. Besides the MapReduce operations, KMR provides routines for collective file reading for affinity-aware optimizations. this paper presents the results of experimental performance studies of KMR on the K computer. Affinity-aware file loading improves the performance by about 42% over a non-optimized implementation. We also show how KMR can be used to program real-world scientific applications such as meta-genome search and replica-exchange molecular dynamics.
暂无评论