Sciweavers

37 search results - page 8 / 8
» Nature inspired genetic algorithms for hard packing problems
Sort
View
COCOON
2008
Springer
13 years 5 months ago
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
MST
2006
149views more  MST 2006»
13 years 3 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier