C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection.
João Marques-Silva
Inês Lynce
Ana Graça
Arlindo L. Oliveira
Published in:
EPIA Workshops (2007)
Keyphrases
</>
haplotype inference
upper bound
branch and bound algorithm
lower bound
entropy minimization
answer set programming
branch and bound
worst case
upper and lower bounds
multi population
np hard problems
efficiently computable
dynamic programming
lower and upper bounds
max sat
greedy heuristic