An O(n log n) algorithm for the maximum agreement subtree problem for binary trees

Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa Przytycka, Mikkel Thorup

Research output: Contribution to journalArticle

Abstract

The maximum agreement subtree problem is the following. Given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(n log n) time algorithm for this problem.

Original languageEnglish (US)
Pages (from-to)1385-1404
Number of pages20
JournalSIAM Journal on Computing
Volume30
Issue number5
StatePublished - 2000

Fingerprint

Binary trees
Binary Tree
Rooted Trees
Leaves
Isomorphic
Binary
Subset

Keywords

  • Agreement subtree
  • Algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., & Thorup, M. (2000). An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing, 30(5), 1385-1404.

An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. / Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel.

In: SIAM Journal on Computing, Vol. 30, No. 5, 2000, p. 1385-1404.

Research output: Contribution to journalArticle

Cole, R, Farach-Colton, M, Hariharan, R, Przytycka, T & Thorup, M 2000, 'An O(n log n) algorithm for the maximum agreement subtree problem for binary trees', SIAM Journal on Computing, vol. 30, no. 5, pp. 1385-1404.
Cole R, Farach-Colton M, Hariharan R, Przytycka T, Thorup M. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing. 2000;30(5):1385-1404.
Cole, Richard ; Farach-Colton, Martin ; Hariharan, Ramesh ; Przytycka, Teresa ; Thorup, Mikkel. / An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. In: SIAM Journal on Computing. 2000 ; Vol. 30, No. 5. pp. 1385-1404.
@article{b6bd72057552486c9c583a22ba475bfa,
title = "An O(n log n) algorithm for the maximum agreement subtree problem for binary trees",
abstract = "The maximum agreement subtree problem is the following. Given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(n log n) time algorithm for this problem.",
keywords = "Agreement subtree, Algorithms",
author = "Richard Cole and Martin Farach-Colton and Ramesh Hariharan and Teresa Przytycka and Mikkel Thorup",
year = "2000",
language = "English (US)",
volume = "30",
pages = "1385--1404",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "5",

}

TY - JOUR

T1 - An O(n log n) algorithm for the maximum agreement subtree problem for binary trees

AU - Cole, Richard

AU - Farach-Colton, Martin

AU - Hariharan, Ramesh

AU - Przytycka, Teresa

AU - Thorup, Mikkel

PY - 2000

Y1 - 2000

N2 - The maximum agreement subtree problem is the following. Given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(n log n) time algorithm for this problem.

AB - The maximum agreement subtree problem is the following. Given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(n log n) time algorithm for this problem.

KW - Agreement subtree

KW - Algorithms

UR - http://www.scopus.com/inward/record.url?scp=0035189546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035189546&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035189546

VL - 30

SP - 1385

EP - 1404

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 5

ER -