Pages that link to "Item:Q1781994"
From MaRDI portal
The following pages link to Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994):
Displaying 11 items.
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs (Q958213) (← links)
- Theory and algorithms for the haplotype assembly problem (Q966193) (← links)
- A practical algorithm based on particle swarm optimization for haplotype reconstruction (Q1004420) (← links)
- The complexity of the single individual SNP haplotyping problem (Q2461636) (← links)
- A polynomial case of the parsimony haplotyping problem (Q2494824) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- Algorithmic approaches for the single individual haplotyping problem (Q2805490) (← links)
- Computational problems in noisy SNP and haplotype analysis: block scores, block identification, and population stratification (Q2890437) (← links)
- On the Approximability of Some Haplotyping Problems (Q3638438) (← links)