Login / Signup
The minimum weight clique partition problem and its application to structural variant calling.
Matthew Hayes
Derrick Mullins
Published in:
Int. J. Comput. Biol. Drug Des. (2020)
Keyphrases
</>
minimum weight
maximum weight
bipartite graph
spanning tree
greedy heuristic
weighted graph
randomized algorithm
minimum spanning tree
structural information
maximum cardinality
np hard
greedy algorithm
structural features
tree patterns
objective function
lower bound