86 search results - page 1 / 18 » DNA Models and Algorithms for NP-Complete Problems |
AAAI
2008
13 years 8 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
SIMVIS
2004
13 years 7 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
RECOMB
2010
Springer
13 years 4 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
JCSS
1998
13 years 5 months ago
1998
UPP
2004
Springer
13 years 11 months ago
2004
Springer
Self-assembly is the spontaneous self-ordering of substructures into superstructures driven by the selective affinity of the substructures. DNA provides a molecular scale material...