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...
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...
Content-addressability is a fundamental feature of human memory underlying many associative information retrieval tasks. In contrast to location-based memory devices, content-addre...
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
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...