Sciweavers

497 search results - page 1 / 100
» DNA Computing Based on Splicing: Universality Results
Sort
View
MCU
1998
119views Hardware» more  MCU 1998»
13 years 6 months ago
DNA Computing Based on Splicing: Universality Results
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...
Gheorghe Paun
DNA
2005
Springer
128views Bioinformatics» more  DNA 2005»
13 years 10 months ago
Recognizing DNA Splicing
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...
Matteo Cavaliere, Natasa Jonoska, Peter Leupold
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 4 months ago
Faster exon assembly by sparse spliced alignment
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...
Alexandre Tiskin
BMCBI
2008
102views more  BMCBI 2008»
13 years 5 months ago
Fast splice site detection using information content and feature reduction
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. ...
DNA
2005
Springer
132views Bioinformatics» more  DNA 2005»
13 years 10 months ago
DNA Recombination by XPCR
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...
Giuditta Franco, Vincenzo Manca, Cinzia Giagulli, ...