Results 1  10
of
99,223
Strand Algebras for DNA Computing
"... We present a process algebra for DNA computing, discussing compilation of other formal systems into the algebra, and compilation of the algebra into DNA structures. 1 ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We present a process algebra for DNA computing, discussing compilation of other formal systems into the algebra, and compilation of the algebra into DNA structures. 1
On Implementing Relational Databases on DNA Strands
"... This work describes the theoretical bases of the implementation of relational databases in test tubes, using an abstract model of molecular computing. It species the representation of relations and the execution program of the relational algebra (RA) operations. We investigate the possibilities ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This work describes the theoretical bases of the implementation of relational databases in test tubes, using an abstract model of molecular computing. It species the representation of relations and the execution program of the relational algebra (RA) operations. We investigate the possibilities
Combinatorial Strand Algebra in Insertion Modeling System
"... Modeling System (IMS)[1] is buit on the Algebraic Programming System (APS) that also was developed by A.A. Letichevsky in 1987. and on the way of implementation of strand algebras – a process algebra for DNA computing devised by Luca Cardelli in order to compile other formal systems into the algebra ..."
Abstract
 Add to MetaCart
Modeling System (IMS)[1] is buit on the Algebraic Programming System (APS) that also was developed by A.A. Letichevsky in 1987. and on the way of implementation of strand algebras – a process algebra for DNA computing devised by Luca Cardelli in order to compile other formal systems
The Strand
, 2005
"... We show that it is possible to distinguish between different offshell completions of supergravity at the onshell level. We focus on the comparison of the “new minimal ” formulation of offshell fourdimensional N = 1 supergravity with the “old minimal ” formulation. We show that there are 3manifo ..."
Abstract
 Add to MetaCart
We show that it is possible to distinguish between different offshell completions of supergravity at the onshell level. We focus on the comparison of the “new minimal ” formulation of offshell fourdimensional N = 1 supergravity with the “old minimal ” formulation. We show that there are 3manifolds which admit supersymmetric compactifications in the newminimal formulation but which do not admit supersymmetric compactifications in other formulations. Moreover, on manifolds with boundary the newminimal formulation admits “singleton modes ” which are absent in other formulations. 1
The Strand
, 2001
"... Abstract: We reconstruct the tachyon effective action for unstable Dbranes in superstring theory by examining its behaviour near exactly marginal deformations, where the ambigous higher derivative terms can be eliminated. We then compare this action with that obtained in boundary string field theor ..."
Abstract
 Add to MetaCart
Abstract: We reconstruct the tachyon effective action for unstable Dbranes in superstring theory by examining its behaviour near exactly marginal deformations, where the ambigous higher derivative terms can be eliminated. We then compare this action with that obtained in boundary string field theory and find remarkable agreement. In particular, the tension for lower dimensional branes and the BIaction for the centre of mass motion are reprodued exactly. We also comment on the action for tachyons on
The Strand
, 2000
"... Abstract: We calculate the string loop corrections to the tachyon potential for stable nonBPS Dpbranes on the orbifold T 4 /Z2. We find a nontrivial phase structure and we show that, after tachyon condensation, the nonBPS Dpbranes are attracted to each other for p = 0, 1, 2. We then identify th ..."
Abstract
 Add to MetaCart
Abstract: We calculate the string loop corrections to the tachyon potential for stable nonBPS Dpbranes on the orbifold T 4 /Z2. We find a nontrivial phase structure and we show that, after tachyon condensation, the nonBPS Dpbranes are attracted to each other for p = 0, 1, 2. We then identify the corresponding closed string boundary states together with the massless long range fields they excite. For p = 3, 4 the string loop correction diverge. We identify the massless closed string fields responsible for these
The Strand.
, 2008
"... We find the analogue of the Boillat metric of BornInfeld theory for the M5brane. We show that it provides the propagation cone of all 5brane degrees. In an arbitrary background field, this cone never lies outside the Einstein cone. An energy momentum tensor for the threeform is defined and shown ..."
Abstract
 Add to MetaCart
We find the analogue of the Boillat metric of BornInfeld theory for the M5brane. We show that it provides the propagation cone of all 5brane degrees. In an arbitrary background field, this cone never lies outside the Einstein cone. An energy momentum tensor for the threeform is defined and shown to satisfy the Dominant Energy Condition. The theory is shown to be well defined for all values of the magnetic field but there is a limiting electric field strength. We consider the strong coupling limit of the M5brane and show that the corresponding theory is conformally invariant and admits infinitely many conservation laws. On reduction to the BornInfeld case this agrees with the work of Bia̷lnickiBirula. 1
Error Correction in DNA Computing: Misclassification and Strand Loss
 DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
"... We present a method of transforming an extractbased DNA computation that is errorprone into one that is relatively errorfree. These improvements in error rates are achieved without the supposition of any improvements in the reliability of the underlying laboratory techniques. We assume that only ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a method of transforming an extractbased DNA computation that is errorprone into one that is relatively errorfree. These improvements in error rates are achieved without the supposition of any improvements in the reliability of the underlying laboratory techniques. We assume that only
Analysis Transcriptional control of human p53regulated genes
, 2008
"... The p53 protein regulates the transcription of many different genes in response to a wide variety of stress signals. Following DNA damage, p53 regulates key processes, including DNA repair, cellcycle arrest, senescence and apoptosis, in order to suppress cancer. This Analysis article provides an ..."
Abstract

Cited by 189 (1 self)
 Add to MetaCart
The p53 protein regulates the transcription of many different genes in response to a wide variety of stress signals. Following DNA damage, p53 regulates key processes, including DNA repair, cellcycle arrest, senescence and apoptosis, in order to suppress cancer. This Analysis article provides
Procedures for computing the maximum with dna strands
 In Proceedings of the 2003 International Conference on Parallel and Distributed Processing Techniques and Applications
, 2003
"... Abstract: In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of nonsilicon based computings. In this paper, we consider three procedures for computing the maximum of Ò binary numbers of Ñ bits, which are represent ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
are represented with Ç ÑÒ DNA strands. The first procedure computes the maximum of the binary numbers in Ç Ñ steps using Ç Ò kinds of DNA strands. The second and third procedures also compute the maximum in Ç ÐÓ � Ò and Ç steps using Ç ÑÒ and Ç ÑÒ kinds of DNA strands, respectively.
Results 1  10
of
99,223