The proceedings contain 13 papers. The special focus in this conference is on dnacomputing and molecularprogramming. The topics include: Dominance and T-invariants for petri nets and chemical reaction networks;synth...
ISBN:
(纸本)9783319219981
The proceedings contain 13 papers. The special focus in this conference is on dnacomputing and molecularprogramming. The topics include: Dominance and T-invariants for petri nets and chemical reaction networks;synthesizing and tuning chemical reaction networks with specified behaviours;universal computation and optimal construction in the chemical reaction network-controlled tile assembly model;optimal program-size complexity for self-assembly at temperature 1 in 3D;concentration independent coin flips in tile self-assembly;new geometric algorithms for fully connected staged self-assembly;leader election and shape formation with self-organizing programmable matter;leakless dnastrand displacement systems;supervised learning in an adaptive dnastrand displacement circuit;automated design and verification of localized dna computation circuits;on low energy barrier folding pathways for nucleic acid sequences and stochastic simulation of the kinetics of multiple interacting nucleic acid strands.
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of d...
详细信息
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1 RTAM systems is not computationally universal, which is conjectured but unproven for the aTAM, and like the aTAM, the RTAM is computationally universal at temperature 2. We then show that at temperature 1, when starting from a single tile seed, the RTAM is capable of assembling squares for n odd using only n tile types, but incapable of assembling squares for n even. Moreover, we show that n is a lower bound on the number of tile types needed to assemble squares for n odd in the temperature-1 RTAM. The conjectured lower bound for temperature-1 aTAM systems is . Finally, we give preliminary results toward the classification of which finite connected shapes in can be assembled (strictly or weakly) by a singly seeded (i.e. seed of size 1) RTAM system, including a complete classification of which finite connected shapes can be strictly assembled by mismatch-free singly seeded RTAM systems.
RNA is involved in a wide-range of important molecular processes in the cell, serving diverse functions: regulatory, enzymatic, and structural. Together with its ease and predictability of design, these properties can...
详细信息
RNA is involved in a wide-range of important molecular processes in the cell, serving diverse functions: regulatory, enzymatic, and structural. Together with its ease and predictability of design, these properties can lead RNA to become a useful handle for biological engineers with which to control the cellular machinery. By modifying the many RNA links in cellular processes, it is possible to reprogram cells toward specific design goals. We propose that RNA can be viewed as a molecularprogramming language that, together with protein-based execution platforms, can be used to rewrite wide ranging aspects of cellular function. In this review, we catalogue developments in the use of RNA parts, methods, and associated computational models that have contributed to the programmability of biology. We discuss how RNA part repertoires have been combined to build complex genetic circuits, and review recent applications of RNA-based parts and circuitry. We explore the future potential of RNA engineering and posit that RNA programmability is an important resource for firmly establishing an era of rationally designed synthetic biology.
Demand for data storage is growing exponentially, but the capacity of existing storage media is not keeping up. Using dna to archive data is an attractive possibility because it is extremely dense, with a raw limit of...
详细信息
ISBN:
(纸本)9781450340915
Demand for data storage is growing exponentially, but the capacity of existing storage media is not keeping up. Using dna to archive data is an attractive possibility because it is extremely dense, with a raw limit of 1 exabyte/mm(3) (10(9) GB/mm(3)), and long-lasting, with observed half-life of over 500 years. This paper presents an architecture for a dna-based archival storage system. It is structured as a key-value store, and leverages common biochemical techniques to provide random access. We also propose a new encoding scheme that offers controllable redundancy, trading off reliability for density. We demonstrate feasibility, random access, and robustness of the proposed encoding with wet lab experiments involving 151 kB of synthesized dna and a 42 kB random-access subset, and simulation experiments of larger sets calibrated to the wet lab experiments. Finally, we highlight trends in biotechnology that indicate the impending practicality of dnastorage for much larger datasets.
The development of dna circuits capable of adaptive behavior is a key goal in dnacomputing, as such systems would have potential applications in long-term monitoring and control of biological and chemical systems. In...
详细信息
In this paper we show that Inductive Logic programming (ILP) algorithms for pharmacophore discovery can run efficiently on a grid of inexpensive computers. Designing a new drug is a long, tedious, and very expensive p...
详细信息
ISBN:
(纸本)9781604234961
In this paper we show that Inductive Logic programming (ILP) algorithms for pharmacophore discovery can run efficiently on a grid of inexpensive computers. Designing a new drug is a long, tedious, and very expensive process that can take many years to complete. Machine learning techniques and ILP algorithms have been shown to be valuable aids in speeding discovery of candidate molecularstructures. This paper describes a case study utilizing structure activity relationships and ILP for pharmacophore discovery on an "Xgrid" of Apple G4 computers available at high schools in Kentucky. With this architecture, an algorithm that requires about 9 hours on a single processor, and a little less time on an older tightly-coupled cluster computer, executed in 32 minutes using the donated idle cycles of a large number of loosely-coupled processors in a computational grid.
Simple computations can be performed using the interactions between single-stranded molecules of dna. These interactions are typically toehold-mediated strand displacement reactions in a well-mixed solution. We demons...
详细信息
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of d...
详细信息
ISBN:
(数字)9783319219998
ISBN:
(纸本)9783319219981
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1 RTAM systems is not computationally universal, which is conjectured but unproven for the aTAM, and like the aTAM, the RTAM is computationally universal at temperature 2. We then show that at temperature 1, when starting from a single tile seed, the RTAM is capable of assembling squares for n odd using only n tile types, but incapable of assembling squares for n even. Moreover, we show that n is a lower bound on the number of tile types needed to assemble squares for n odd in the temperature-1 RTAM. The conjectured lower bound for temperature-1 aTAM systems is . Finally, we give preliminary results toward the classification of which finite connected shapes in can be assembled (strictly or weakly) by a singly seeded (i.e. seed of size 1) RTAM system, including a complete classification of which finite connected shapes can be strictly assembled by mismatch-free singly seeded RTAM systems.
Fragmentation trees are a technique for identifying molecular formulas and deriving some chemical properties of metabolites-small organic molecules-solely from mass spectral data. computing these trees involves findin...
详细信息
ISBN:
(纸本)9783319213989;9783319213972
Fragmentation trees are a technique for identifying molecular formulas and deriving some chemical properties of metabolites-small organic molecules-solely from mass spectral data. computing these trees involves finding exact solutions to the NP-hard Maximum Colorful Subtree problem. Existing solvers struggle to solve the large instances involved fast enough to keep up with instrument throughput, and their performance remains a hindrance to adoption in practice. We attack this problem on two fronts: by combining fast and effective reduction algorithms with a strong integer linear program (ILP) formulation of the problem, we achieve overall speedups of 9.4 fold and 8.8 fold on two sets of real-world problems-without sacrificing optimality. Both approaches are, to our knowledge, the first of their kind for this problem. We also evaluate the strategy of solving global problem instances, instead of first subdividing them into many candidate instances as has been done in the past. Software (C++ source for our reduction program and our CPLEX/Gurobi driver program) available under LGPL at https://***/wtwhite/speedycolorfulsubtrees/.
暂无评论