The following pages link to (Q4408101):
Displaying 16 items.
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- Finding odd cycle transversals. (Q703225) (← links)
- A practical algorithm based on particle swarm optimization for haplotype reconstruction (Q1004420) (← links)
- Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994) (← links)
- The haplotyping problem: an overview of computational models and solutions (Q1884294) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Self-organizing map approaches for the haplotype assembly problem (Q2390401) (← links)
- A dynamic programming algorithm for the \(k\)-haplotyping problem (Q2431961) (← links)
- The haplotype assembly model with genotype information and iterative local-exhaustive search algorithm (Q2459122) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Haplotype assembly from aligned weighted SNP fragments (Q2500324) (← links)
- Algorithmic approaches for the single individual haplotyping problem (Q2805490) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information (Q3507318) (← links)
- On the Approximability of Some Haplotyping Problems (Q3638438) (← links)
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design (Q6132388) (← links)
