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:
Bibliographic Details
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
id sg-nus-scholar.10635-40567
record_format dspace
spelling sg-nus-scholar.10635-405672024-11-09T18:18:55Z Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees Hoang, V.T. Sung, W.-K. COMPUTER SCIENCE Maximum agreement supertree Maximum compatible supertree Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008 361-372 2013-07-04T08:07:19Z 2013-07-04T08:07:19Z 2008 Conference Paper Hoang, V.T.,Sung, W.-K. (2008). 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 : 361-372. ScholarBank@NUS Repository. 9783939897064 http://scholarbank.nus.edu.sg/handle/10635/40567 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Maximum agreement supertree
Maximum compatible supertree
spellingShingle Maximum agreement supertree
Maximum compatible supertree
Hoang, V.T.
Sung, W.-K.
Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
description Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008
author2 COMPUTER SCIENCE
author_facet COMPUTER SCIENCE
Hoang, V.T.
Sung, W.-K.
format Conference or Workshop Item
author Hoang, V.T.
Sung, W.-K.
author_sort Hoang, V.T.
title Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
title_short Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
title_full Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
title_fullStr Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
title_full_unstemmed Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
title_sort fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
publishDate 2013
url http://scholarbank.nus.edu.sg/handle/10635/40567
_version_ 1821227051317723136