An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
✍ Scribed by Ming-Yang Kao; Tak-Wah Lam; Wing-Kin Sung; Hing-Fung Ting
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 185 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
✦ Synopsis
This paper combines results of three conference papers: (1) A faster and unifying algorithm for comparing trees, in "Proceedings of the 11th Symposium on Combinatorial Pattern Matching, 2000," pp. 129-142; (2) Unbalanced and hierarchical bipartite matchings with applications to labeled tree comparison. in "Proceedings of the 11th International Symposium on Algorithms and Computation, 2000," pp. 479-490; (3) A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees, in "Proceedings of the 8th Annual European Symposium on Algorithms, 1999," pp. 438-449.