Boosting Haplotype Inference with Local Search
نویسندگان
چکیده
منابع مشابه
Flexible Stochastic Local Search for Haplotype Inference
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researchers to perform association studies for the genetic variants involved in diseases and the individual responses to therapeutic agents. A notable approach to the problem is to encode it as a com...
متن کاملBoosting Local Search with Artificial Ants
Local Search: Incomplete approaches for solving CSPs are usually based on local search —or neighborhood search— techniques [4]: the idea is to start from an inconsistent complete assignment of values to the variables, and then gradually and iteratively repair it by changing some variable-value assignments, preferably towards better ones. One of the main problems with local search is that it may...
متن کاملBoosting local search with Lagrangian relaxation
Local search algorithms play an essential role in solving large-scale combinatorial optimization problems. Traditionally, the local search procedure is guided mainly by the objective function of the problem. Hence, the greedy improvement paradigm poses the potential threat of prematurely getting trapped in low quality attraction basins. In this study, we intend to utilize the information extrac...
متن کاملBoosting Partial Symmetry Breaking by Local Search
S. D. Prestwich, B. Hnich, H. Simonis, R. Rossi, and S. A. Tarim Cork Constraint Computation Centre, University College Cork, Ireland Faculty of Computer Science, Izmir University of Economics, Turkey Logistics, Decision and Information Sciences Group, Wageningen UR, the Netherlands Operations Management Division, Nottingham University Business School, Nottingham, UK [email protected], brah...
متن کاملBoosting Local Search Thanks to cdcl
In this paper, a novel hybrid and complete approach for propositional satisfiability, called SATHYS (Sat Hybrid Solver), is introduced. It efficiently combines the strength of both local search and CDCL based SAT solvers. Considering the consistent partial assignment under construction by the CDCL SAT solver, local search is used to extend it to a model of the Boolean formula, while the CDCL co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2008
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-007-9035-7