Maximum Agreement Subtree In a Set Of Evolutionary Trees

dc.contributor.author Amir, Amihood en_US
dc.contributor.author Keselman, Dmitry
dc.date.accessioned 2005-06-17T18:03:51Z
dc.date.available 2005-06-17T18:03:51Z
dc.date.issued 1993 en_US
dc.description.abstract The maximum agreement subtree approach is one method of reconciling different evolution trees for the same set of species. Recently, dynamic programming ideas were used by Steele and Warnow to provide polynomial time algorithms for finding a maximum agreement subtree of two trees. Their methods do not generalize to sets of more than two trees. In this paper we prove that the maximum agreement subtree problem is NP-complete for three trees with unbounded degrees. We also develop a new method for finding the maximum agreement subtree of k trees of degree d. This new method enables us to find the maximum agreement subtree in time O(n[superscript d]+kn³) en_US
dc.format.extent 166907 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/6773
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.relation.ispartofseries CC Technical Report; GIT-CC-93-41 en_US
dc.subject Classification
dc.subject Computational complexity
dc.subject Evolutionary trees
dc.subject Maximum agreement subtrees
dc.subject Nondeterministic polynomial time
dc.subject NP-completeness
dc.subject Polynomial time algorithms
dc.subject Weighted agreement
dc.title Maximum Agreement Subtree In a Set Of Evolutionary Trees en_US
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.corporatename College of Computing
local.relation.ispartofseries College of Computing Technical Report Series
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication 35c9e8fc-dd67-4201-b1d5-016381ef65b8
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
163 KB
Adobe Portable Document Format