Algorithmic approaches for the single individual haplotyping problem
From MaRDI portal
Publication:2805490
DOI10.1051/RO/2015037zbMATH Open1337.92143OpenAlexW2323920142MaRDI QIDQ2805490FDOQ2805490
Publication date: 11 May 2016
Published in: RAIRO. Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bad61d7934f8ecf6e4c5e5752bba499aa8fbf1cd
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
Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Software, source code, etc. for problems pertaining to biology (92-04)
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Opportunities for combinatorial optimization in computational biology
- The complexity of the single individual SNP haplotyping problem
- Title not available (Why is that?)
- Polynomial and APX-hard cases of the individual haplotyping problem
- Haplotype assembly from aligned weighted SNP fragments
- Title not available (Why is that?)
- An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs
- Title not available (Why is that?)
Cited In (4)
Uses Software
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)
