Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008
Saved in:
Main Authors: | Hoang, V.T., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40567 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Improved algorithms for maximum agreement and compatible supertrees
by: Hoang, V.T., et al.
Published: (2013) -
Rooted maximum agreement supertrees
by: Jansson, J., et al.
Published: (2013) -
Anthropogenic extinction threats and future loss of evolutionary history in reef corals
by: Huang, D., et al.
Published: (2014) -
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)