Algorithmic approaches for the single individual haplotyping problem
From MaRDI portal
Publication:2805490
Recommendations
- Polynomial and APX-hard cases of the individual haplotyping problem
- The complexity of the single individual SNP haplotyping problem
- The haplotyping problem: an overview of computational models and solutions
- Theory and algorithms for the haplotype assembly problem
- New results for the longest haplotype reconstruction problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1945152 (Why is no real title available?)
- scientific article; zbMATH DE number 1877046 (Why is no real title available?)
- An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs
- Enhanced evolutionary and heuristic algorithms for haplotype reconstruction problem using minimum error correction model
- Haplotype assembly from aligned weighted SNP fragments
- Opportunities for combinatorial optimization in computational biology
- Polynomial and APX-hard cases of the individual haplotyping problem
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The complexity of the single individual SNP haplotyping problem
Cited in
(5)- On the Approximability of Some Haplotyping Problems
- Recent advances in operations research in computational biology, bioinformatics and medicine
- Self-organizing map approaches for the haplotype assembly problem
- Computational Methods for SNPs and Haplotype Inference
- A guided tour to computational haplotyping
This page was built for publication: Algorithmic approaches for the single individual haplotyping problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805490)