Login / Signup

Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver.

Vladimir UlyantsevMikhail Melnik
Published in: AlCoB (2015)
Keyphrases
  • sat solvers
  • phylogenetic trees
  • boolean satisfiability
  • sat solving
  • search space
  • query processing
  • np complete
  • orders of magnitude
  • heuristic search
  • constraint satisfaction