Login / Signup
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs.
Tom Davot
Annie Chateau
Rodolphe Giroudeau
Mathias Weller
Published in:
RECOMB-CG (2018)
Keyphrases
</>
computational complexity
data sharing
instructional design
problem based learning
np hard
linear programming
phase transition
learning theory
decision trees
learning environment
worst case
np complete
information sharing
multiple users