• Home
  • Search
  • HAPLOTYPE INFERENCE WITH BOOLEAN SATISFIABILITY
  • Open Access IconOpen Access
  • Cite Icon19
  • https://doi.org/10.1142/s0218213008003935Copy DOI Icon

HAPLOTYPE INFERENCE WITH BOOLEAN SATISFIABILITY

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Mutation in DNA is the principal cause for differences among human beings, and Single Nucleotide Polymorphisms (SNPs) are the most common mutations. Hence, a fundamental task is to complete a map of haplotypes (which identify SNPs) in the human population. Associated with this effort, a key computational problem is the inference of haplotype data from genotype data, since in practice genotype data rather than haplotype data is usually obtained. Different haplotype inference approaches have been proposed, including the utilization of statistical methods and the utilization of the pure parsimony criterion. The problem of haplotype inference by pure parsimony (HIPP) is interesting not only because of its application to haplotype inference, but also because it is a challenging NP-hard problem, being APX-hard. Recent work has shown that a SAT-based approach is the most efficient approach for the problem of haplotype inference by pure parsimony (HIPP), being several orders of magnitude faster than existing integer linear programming and branch and bound solutions. This paper provides a detailed description of SHIPs, a SAT-based approach for the HIPP problem, and presents comprehensive experimental results comparing SHIPs with all other exact approaches for the HIPP problem. These results confirm that SHIPs is currently the most effective approach for the HIPP problem.

Similar Papers
  • Book Chapter
  • Citations38

Efficient Haplotype Inference with Pseudo-boolean Optimization

  • Jul 02, 2007
  • Ana Graça +3
  • Conference Article
  • Citations5

TOWARD AN ALGEBRAIC UNDERSTANDING OF HAPLOTYPE INFERENCE BY PURE PARSIMONY

  • Jul 01, 2006
  • Daniel G Brown +1
  • Book Chapter
  • Citations5

Complete Parsimony Haplotype Inference Problem and Algorithms

  • Jan 01, 2009
  • Gerold Jäger +2
  • Research Article
  • Citations1

Mathematical properties and bounds on haplotyping populations by pure parsimony

  • Feb 24, 2011
  • Mathematical Biosciences
  • I-Lin Wang +1
  • Book Chapter
  • Citations24

Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event

  • Jan 01, 2005
  • Yun S Song +2
  • Conference Article
  • Citations1

Computational Experiments on Algorithms for Haplotype Inference Problems by Pure Parsimony

  • Jan 01, 2006
  • I-Lin Wang +1
  • Research Article
  • Citations4

A fast haplotype inference method for large population genotype data

  • Apr 15, 2008
  • Computational Statistics & Data Analysis
  • Ji-Hong Zhang +3
  • Research Article
  • Citations179

Haplotype block partitioning and tag SNP selection using genotype data and their applications to association studies.

  • Apr 12, 2004
  • Genome Research
  • Kui Zhang +5
  • Conference Article
  • Citations2

A Fast and Efficient Ant Colony Optimization for Haplotype Inference by Pure Parsimony

  • Oct 01, 2011
  • Dong Do Duc +1
  • Book Chapter
  • Citations4

Haplotype Inference Constrained by Plausible Haplotype Data

  • Jan 01, 2009
  • Michael R Fellows +5
  • Dissertation

Improvement of dynamic programming time for a long haplotype in the problem of haplotype inference on a pedigree containing some missing alleles

  • Jan 01, 2004
  • Amares Kotcharat
  • Conference Article
  • Citations1

Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony

  • Sep 01, 2008
  • Stefano Benedettini +2
  • Book Chapter
  • Citations1

Pure Parsimony Xor Haplotyping

  • Jan 01, 2009
  • Paola Bonizzoni +4
  • Front Matter
  • Citations10

The Genetic Basis for Periodic Fever

  • Apr 01, 1999
  • The American Journal of Human Genetics
  • John C Mulley
  • Peer Review Report

Decision letter: Limited role of generation time changes in driving the evolution of the mutation spectrum in humans

  • Aug 22, 2022
  • Laurent Duret
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.