Login / Signup
Partial Orthology, Paralogy and Xenology Relations - Satisfiability in terms of Di-Cographs.
Nikolai Nøjgaard
Nadia El-Mabrouk
Daniel Merkle
Nicolas Wieseke
Marc Hellmuth
Published in:
CoRR (2017)
Keyphrases
</>
computational complexity
bayesian networks
background knowledge
data sets
search algorithm
phase transition
satisfiability problem