### 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 language | English (US) |
---|---|

Pages (from-to) | 1385-1404 |

Number of pages | 20 |

Journal | SIAM Journal on Computing |

Volume | 30 |

Issue number | 5 |

State | Published - 2000 |

### Fingerprint

### Keywords

- Agreement subtree
- Algorithms

### ASJC Scopus subject areas

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

### Cite this

*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.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 30, no. 5, pp. 1385-1404.

}

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 -