Sciweavers

621 search results - page 28 / 125
» DNA Computing in Microreactors
Sort
View
DISOPT
2007
93views more  DISOPT 2007»
13 years 8 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...
DNA
2005
Springer
102views Bioinformatics» more  DNA 2005»
14 years 1 months ago
Chain Reaction Systems Based on Loop Dissociation of DNA
In the field of DNA computing, more and more efforts are made for constructing molecular machines made of DNA that work in vitro or in vivo. States of some of those machines are...
Keiichiro Takahashi, Satsuki Yaegashi, Atsushi Kam...
DNA
2006
Springer
110views Bioinformatics» more  DNA 2006»
13 years 11 months ago
DNA Hypernetworks for Information Storage and Retrieval
Content-addressability is a fundamental feature of human memory underlying many associative information retrieval tasks. In contrast to location-based memory devices, content-addre...
Byoung-Tak Zhang, Joo-Kyung Kim
CAD
2006
Springer
13 years 8 months ago
Laplace-Beltrami spectra as 'Shape-DNA' of surfaces and solids
This paper introduces a method to extract `Shape-DNA', a numerical fingerprint or signature, of any 2d or 3d manifold (surface or solid) by taking the eigenvalues (i.e. the s...
Martin Reuter, Franz-Erich Wolter, Niklas Peinecke
HPCC
2009
Springer
14 years 18 days ago
Load Scheduling Strategies for Parallel DNA Sequencing Applications
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
Sudha Gunturu, Xiaolin Li, Laurence Tianruo Yang