Sciweavers

18 search results - page 2 / 4
» A Class Representative Model for Pure Parsimony Haplotyping
Sort
View
AAAI
2006
13 years 7 months ago
Efficient Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva
IJAIT
2008
107views more  IJAIT 2008»
13 years 5 months ago
Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
13 years 5 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...
EXPCS
2007
13 years 9 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan