The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Polynomial-time algorithms for the ordered maximum agreement subtree problem

På svenska

Author

Summary, in English

For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) in all of the input trees with as many labeled leaves as possible. We study the ordered variants of MAST where the trees are uniformly or non-uniformly ordered. We provide the first known polynomial-time algorithms for the uniformly and non-uniformly ordered homeomorphic variants as well as the uniformly and non-uniformly ordered isomorphic variants of MAST. Our algorithms run in time O(kn(3)), O (n(3) min{kn, n + log(k-1) n}), O(kn(3)), and O(n(3) min{kn, n + log(k-1) n)), respectively, where n is the number of leaf labels and k is the number of input trees.

Department/s

  • Computer Science

Publishing year

2007

Language

English

Pages

233-248

Publication/Series

Algorithmica

Volume

48

Issue

3

Document type

Journal article

Publisher

Springer

Topic

  • Computer Science

Keywords

  • algorithm
  • maximum agreement subtree
  • ordered tree
  • evolutionary tree
  • time complexity

Status

Published

Project

  • VR 2005-4085

ISBN/ISSN/Other

  • ISSN: 0178-4617