Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
From MaRDI portal
Publication:941662
DOI10.1007/s10601-007-9029-5zbMath1144.92324OpenAlexW2012798676MaRDI QIDQ941662
Thomas Schiex, Marti Sanchez, Simon de Givry
Publication date: 2 September 2008
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-007-9029-5
Problems related to evolution (92D15) Computing methodologies and applications (68U99) Genetics and epigenetics (92D10)
Related Items
Tractability-preserving transformations of global cost functions ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ Multiple-choice knapsack constraint in graphical models ⋮ Virtual pairwise consistency in cost function networks ⋮ An abstract interpretation framework for genotype elimination algorithms ⋮ Triangle-based consistencies for cost function networks ⋮ CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability ⋮ Soft arc consistency revisited ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
Uses Software
Cites Work
- High-order consistency in valued constraint satisfaction
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Reduction operations in fuzzy or valued constraint satisfaction
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Principles and Practice of Constraint Programming – CP 2003
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
