Boosting haplotype inference with local search

DOI10.1007/s10601-007-9035-7zbMath1142.92030OpenAlexW1992829979MaRDI QIDQ941674

Inês Lynce, João P. Marques-Silva, Steven Prestwich

Publication date: 2 September 2008

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/264999/1/jpms-cj08.pdf

zbMATH Keywords

Boolean satisfiability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Genetics and epigenetics (92D10)

Related Items (4)

The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability ⋮ Haplotype inference with pseudo-Boolean optimization ⋮ Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics ⋮ SAT and IP based algorithms for magic labeling including a complete search for total magic labelings

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Negative effects of modeling techniques on search performance
• Random backtracking in backtrack search algorithms for satisfiability
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
• Theory and Applications of Satisfiability Testing
• Computational Methods for SNPs and Haplotype Inference
• Research in Computational Molecular Biology
• Theory and Applications of Satisfiability Testing

This page was built for publication: Boosting haplotype inference with local search