Login / Signup

Partial convex recolorings of trees and galled networks: Tight upper and lower bounds.

Shlomo MoranSagi SnirWing-Kin Sung
Published in: ACM Trans. Algorithms (2011)
Keyphrases
  • gene trees
  • tight upper and lower bounds
  • upper bound
  • network structure
  • decision trees
  • markov random field
  • convex optimization
  • upper and lower bounds