1793 search results - page 6 / 359 » On the Design of Codes for DNA Computing |
DNA
2004
Springer
15 years 3 months ago
2004
Springer
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesir...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an efficient, fully automated algorithm to assemble ESTs into full-length cDNA sequences that represent the complete coding regions of a gene. Our EST clustering algori...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
BMCBI
2005
14 years 9 months ago
2005
Background: Alignments of homologous DNA sequences are crucial for comparative genomics and phylogenetic analysis. However, multiple alignment represents a computationally difficu...