Pages that link to "Item:Q2461636"
From MaRDI portal
The following pages link to The complexity of the single individual SNP haplotyping problem (Q2461636):
Displaying 18 items.
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- A practical exact algorithm for the individual haplotyping problem MEC/GI (Q848946) (← links)
- An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs (Q958213) (← links)
- NP-hardness of Euclidean sum-of-squares clustering (Q1009338) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994) (← links)
- On a fixed haplotype variant of the minimum error correction problem (Q1791017) (← links)
- A guided tour to computational haplotyping (Q2011635) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Haplotype assembly from aligned weighted SNP fragments (Q2500324) (← links)
- Algorithmic approaches for the single individual haplotyping problem (Q2805490) (← links)
- On the complexity of MMSNP (Q2902910) (← links)
- Parameterizing MAX SNP Problems Above Guaranteed Values (Q3499722) (← links)
- On the Approximability of Some Haplotyping Problems (Q3638438) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- (Q5009594) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)