Computing the maximum agreement of phylogenetic networks
10.1016/j.tcs.2004.12.012
Saved in:
Main Authors: | Choy, C., Jansson, J., Sadakane, K., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39452 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Computing the maximum agreement of phylogenetic networks
by: Choy, C., et al.
Published: (2013) -
Rooted maximum agreement supertrees
by: Jansson, J., et al.
Published: (2013) -
Improved algorithms for maximum agreement and compatible supertrees
by: Hoang, V.T., et al.
Published: (2013) -
Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
by: Hoang, V.T., et al.
Published: (2013) -
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
by: Jansson, J., et al.
Published: (2013)