Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
10.1145/2000807.2000810
Saved in:
Main Authors: | Moran, S., Snir, S., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39031 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Algorithms for combining rooted triplets into a galled phylogenetic network
by: Jansson, J., et al.
Published: (2013) -
Manifold preserving edit propagation
by: Chen, X., et al.
Published: (2014) -
Edge colorings of K2n with a prescribed condition - I
by: Liu, Q.Z., et al.
Published: (2013) -
Inferring phylogenetic relationships avoiding forbidding rooted triplets
by: He, Y.-J., et al.
Published: (2013) -
Subtree transfer distance for degree-D phylogenies
by: Hon, W.-K., et al.
Published: (2014)