Boosting haplotype inference with local search

DOI10.1007/S10601-007-9035-7MaRDI QIDQ941674zbMATH OpenOpenAlexFDO

Authors Inês Lynce, Joao 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)

Recommendations

• Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
• 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
• Efficient Haplotype Inference with Pseudo-boolean Optimization

Cites work

• Computational Methods for SNPs and Haplotype Inference
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Negative effects of modeling techniques on search performance
• Random backtracking in backtrack search algorithms for satisfiability
• Research in Computational Molecular Biology
• Stochastic local search. Foundations and applications.
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

Cited in

(6)

• SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
• The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
• Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
• Efficient Haplotype Inference with Pseudo-boolean Optimization
• Haplotype inference with pseudo-Boolean optimization
• Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics

Describes a project that uses

Uses Software

• MiniSat

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941674)