156 search results - page 1 / 32 » In Search of Optimal Codes for DNA Computing |
DNA
2006
Springer
13 years 9 months ago
2006
Springer
CIBCB
2007
IEEE
13 years 11 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...