621 search results - page 25 / 125 » DNA Computing |
DISOPT
2007
13 years 10 months ago
2007
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...
WOLLIC
2007
Springer
14 years 4 months ago
2007
Springer
HPCC
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
COMPLIFE
2006
Springer
14 years 2 months ago
2006
Springer
The ability to locate promoters within a section of DNA is known to be a very difficult and very important task in DNA analysis. We document an approach that incorporates the conce...
DNA
2006
Springer
14 years 2 months ago
2006
Springer
Content-addressability is a fundamental feature of human memory underlying many associative information retrieval tasks. In contrast to location-based memory devices, content-addre...