Pages that link to "Item:Q3638438"
From MaRDI portal
The following pages link to On the Approximability of Some Haplotyping Problems (Q3638438):
Displaying 10 items.
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- Solving haplotype inference problem with non-genotyped founders via integer linear programming (Q434198) (← links)
- Some notes on the combinatorial properties of haplotype tagging (Q1410355) (← links)
- Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994) (← links)
- A polynomial case of the parsimony haplotyping problem (Q2494824) (← links)
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms (Q2890436) (← links)
- Computational problems in noisy SNP and haplotype analysis: block scores, block identification, and population stratification (Q2890437) (← links)
- The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification (Q3060204) (← links)
- Finding all maximal perfect haplotype blocks in linear time (Q5091735) (← links)
- Algorithms and Computation (Q5897870) (← links)