28 search results - page 4 / 6 » Combinatorial Problems Arising in SNP and Haplotype Analysis |
BMCBI
2010
13 years 7 months ago
2010
Background: It has now become clear that gene-gene interactions and gene-environment interactions are ubiquitous and fundamental mechanisms for the development of complex diseases...
COR
2006
13 years 7 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
EVOW
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
EVOW
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
FOCS
2002
IEEE
14 years 12 days ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...