621 search results - page 25 / 125 » DNA Computing |
131
click to vote
DISOPT
2007
15 years 2 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
15 years 8 months ago
2007
Springer
127
Voted
HPCC
2009
Springer
15 years 7 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...
130
Voted
COMPLIFE
2006
Springer
15 years 6 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...
108
Voted
DNA
2006
Springer
15 years 6 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...