### Abstract

A widely-used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure only concerns with the comparison of labeled trees of two special kinds, namely, uniformly labeled trees (i.e., trees with all their nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled trees with distinct symbols for distinct leaves). This paper presents an algorithm for comparing trees that are labeled in an arbitrary manner. In addition to the generalization, our algorithm is faster than the previous algorithms in many cases.

Original language | English (US) |
---|---|

Title of host publication | Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings |

Editors | David Sankoff, Raffaele Giancarlo |

Publisher | Springer Verlag |

Pages | 129-142 |

Number of pages | 14 |

ISBN (Electronic) | 3540676333, 9783540676331 |

State | Published - Jan 1 2000 |

Event | 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000 - Montreal, Canada Duration: Jun 21 2000 → Jun 23 2000 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1848 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000 |
---|---|

Country | Canada |

City | Montreal |

Period | 6/21/00 → 6/23/00 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings*(pp. 129-142). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1848). Springer Verlag.

}

*Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1848, Springer Verlag, pp. 129-142, 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, Montreal, Canada, 6/21/00.

**A faster and unifying algorithm for comparing trees.** / Kao, Ming Yang; Lam, Tak Wah; Sung, Wing Kin; Ting, Hing Fung.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A faster and unifying algorithm for comparing trees

AU - Kao, Ming Yang

AU - Lam, Tak Wah

AU - Sung, Wing Kin

AU - Ting, Hing Fung

PY - 2000/1/1

Y1 - 2000/1/1

N2 - A widely-used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure only concerns with the comparison of labeled trees of two special kinds, namely, uniformly labeled trees (i.e., trees with all their nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled trees with distinct symbols for distinct leaves). This paper presents an algorithm for comparing trees that are labeled in an arbitrary manner. In addition to the generalization, our algorithm is faster than the previous algorithms in many cases.

AB - A widely-used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure only concerns with the comparison of labeled trees of two special kinds, namely, uniformly labeled trees (i.e., trees with all their nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled trees with distinct symbols for distinct leaves). This paper presents an algorithm for comparing trees that are labeled in an arbitrary manner. In addition to the generalization, our algorithm is faster than the previous algorithms in many cases.

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

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

M3 - Conference contribution

AN - SCOPUS:84937459112

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 129

EP - 142

BT - Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings

A2 - Sankoff, David

A2 - Giancarlo, Raffaele

PB - Springer Verlag

ER -