Name
Abstract | ||
|---|---|---|
•The problem of finding allelable graphs for haplotype phasing can be solved via mathematical programming.•Based on graph colouring, several formulations are studied and valid inequalities are devised.•When applied to a real dataset, the proposed formulations significantly improve the running times with respect to the existing models.•New synthetically generated datasets are proposed for the problem. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ejor.2020.07.001 | European Journal of Operational Research |
Keywords | DocType | Volume |
Line graphs,Discrete optimization,Haplotyping | Journal | 289 |
Issue | ISSN | Citations |
1 | 0377-2217 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| martine labbe | 1 | 1238 | 108.61 |
| Alfredo Marín | 2 | 453 | 32.98 |
| Mercedes Pelegrin | 3 | 0 | 1.69 |