Sciweavers

4860 search results - page 10 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
BMCBI
2007
108views more  BMCBI 2007»
13 years 7 months ago
Computer-aided identification of polymorphism sets diagnostic for groups of bacterial and viral genetic variants
Background: Single nucleotide polymorphisms (SNPs) and genes that exhibit presence/absence variation have provided informative marker sets for bacterial and viral genotyping. Iden...
Erin P. Price, John Inman-Bamber, Venugopal Thiruv...
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 2 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
BMCBI
2006
169views more  BMCBI 2006»
13 years 7 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
AAAI
2012
11 years 9 months ago
Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
Blai Bonet, Hector Geffner
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
14 years 1 months ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens