The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Abstract. Motivated by recent techniques developed for observing evolutionary dynamics of a single DNA molecule, we introduce a formal model for accepting an observed behavior of a...
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...