.png){kind=icon}
.png){kind=icon}
Return
Haplotype inference with pseudo-Boolean optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-009-0675-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The fast development of sequencing techniques in the recent past has required an urgent development of efficient and accurate haplotype inference tools. Besides being a crucial issue in genetics, haplotype inference is also a challenging computational problem. Among others, pure parsimony is a viable modeling approach to solve the problem of haplotype inference and also an interesting NP-hard problem in itself. Recently, the introduction of SAT-based methods, including pseudo-Boolean optimization (PBO) methods, has produced very efficient solvers. This paper provides a detailed description of RPoly, a PBO approach for the haplotype inference by pure parsimony (HIPP) problem. Moreover, an extensive evaluation of existent HIPP solvers, on a comprehensive set of instances, confirms that RPoly is currently the most efficient and robust HIPP approach.
Keywords:
Haplotype inference
Pure parsimony
Pseudo-Boolean optimization
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W