An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs

DOI10.1007/s00453-007-9150-2zbMath1173.68834OpenAlexW2001570677MaRDI QIDQ958213

Jianxin Wang, Minzhu Xie

Publication date: 2 December 2008

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9150-2

zbMATH Keywords

NP-hardnessSNPgenotypeparameterized algorithmhaplotypesingle-nucleotide polymorphism

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99)

Related Items (4)

A practical exact algorithm for the individual haplotyping problem MEC/GI ⋮ Parameterized complexity analysis for the closest string with wildcards problem ⋮ A practical parameterised algorithm for the individual haplotyping problem MLF ⋮ Algorithmic approaches for the single individual haplotyping problem

Cites Work

• Unnamed Item
• Polynomial and APX-hard cases of the individual haplotyping problem
• Comparing Assemblies Using Fragments and Mate-Pairs
• Experimental and Efficient Algorithms

This page was built for publication: An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs