Rooted maximum agreement supertrees
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Jansson, J., Ng, J.H.-K., Sadakane, K., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39122 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
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) -
Computing the maximum agreement of phylogenetic networks
by: Choy, C., et al.
Published: (2013) -
Computing the maximum agreement of phylogenetic networks
by: Choy, C., et al.
Published: (2013)