Sciweavers

131 search results - page 1 / 27
» Computational complexity of isothermic DNA sequencing by hyb...
Sort
View
DAM
2006
106views more  DAM 2006»
13 years 3 months ago
Computational complexity of isothermic DNA sequencing by hybridization
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
Jacek Blazewicz, Marta Kasprzak
DNA
2008
Springer
121views Bioinformatics» more  DNA 2008»
13 years 5 months ago
Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation
Whiplash PCR (WPCR), due to Hagiya et al. [1], is a novel technique for autonomous molecular computation where a state machine is implemented with a single stranded DNA molecule a...
John H. Reif, Urmi Majumder
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
13 years 9 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
CANDC
2006
ACM
13 years 3 months ago
Dealing with repetitions in sequencing by hybridization
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
Jacek Blazewicz, Fred Glover, Marta Kasprzak, Wojc...
DISOPT
2007
93views more  DISOPT 2007»
13 years 3 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...