An even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings

Journal of Algorithms

Volumn 40, Issue 2, 2001, Pages 212-233

  Kao, Ming Yang ^a   Lam, Tak Wah ^b   Sung, Wing Kin ^b   Ting, Hing Fung ^b  

^a Yale University   (United States)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347752674     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1163     Document Type: Article

References (27)

1. S. Abiteboul, On views and XML, in "Proceedings of the ACM Symposium on Principle of Database Systems, 1999," pp. 1-9.
2. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan, Improved algorithms for bipartite network flow, SIAM J. Comput. 23, No. 5 (1994), 906-933.
3. 2.5) time algorithms for the subgraph homeomorphism problem on trees, J. Algorithms 8, (1987), 106-112.
4. R. Cole, M. Farach, R. Hariharan, T. Przytycka, and M. Thorup, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, SIAM J. Comput. 30, No. 5 (2001), 1385-1404.
5. T. H. Cormen, C. L. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
6. M. Farach, T. M. Przytycka, and M. Thorup, Computing the agreement of trees with bounded degrees, in "Proceedings of the 3rd Annual European Symposium on Algorithms" (P. Spirakis, Ed.), Lecture Notes in Computer Science, Vol. 979: pp. 381-393, Springer-Verlag, New York, 1995.
7. M. Farach and M. Thorup, Sparse dynamic programming for evolutionary-tree comparison, SIAM J. Comput. 26, No. 1 (1997), 210-230.
8. C. R. Finden and A. D. Gordon, Obtaining common pruned trees, J. Classification 2, (1985), 255-276.
9. J. Friedman, Expressing logical formulas in natural languages, in "Formal Methods in the Study of Language" (J. Groenendijk, T. Janssen, and M. Stokhof, Eds.), pp. 113-130, Mathmatical Centre, Amsterdam, 1981.
10. H. N. Gabow and R. E. Tarjan, Faster scaling algorithms for network problems, SIAM J. Comput. 18, No. 5 (1989), 1013-1036.
11. A. Gupta and N. Nishimura, Finding largest subtrees and smallest supertrees, Algorithmica 21, No. 2 (1998), 183-210.
12. D. Gusfield, C. Martel, and D. Fernández-Baca. Fast algorithms for bipartite network flow, SIAM J. Comput. 16, No. 2 (1987), 237-251.
13. D. M. Hillis, C. Moritz, and B. K. Mable (Eds.), "Molecular Systematics," (2nd ed.), Sinauer Associates, Sunderland, MA, 1996.
14. M. Y. Kao Tree contractions and evolutionary trees, SIAM J. Comput. 27, No. 6 (Dec. 1998), 1592-1616.
15. M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting, A decomposition theorem for maximum weight bipartite matchings, SIAM J. Comput. (2000). to appear.
16. P. Kilpeläinen and H. Mannila, Retrieval from hierarchical texts by partial patterns, in "Proceedings of the 16th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, 1991," pp. 214-222.
17. P. Kilpeläinen and H. Mannila, Grammatical tree matching, in "Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching," (A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, Eds.), Lecture Notes in Computer Science, Vol. 644: pp. 162-174, Springer-Verlag, New York, 1992.
18. B. Kimia, A. Tannenbaum, and S. W. Zucker, Shapes, shocks, and deformations, I, Internat. J. Comput. Vision 15 (1995), 189-224.
19. S. Y. Le, J. Owens, R. Nussinov, J. H. Chen, B. Shapiro, and J. V. Maizel, RNA secondary structures: Comparison and determination of frequently recurring substructures by consensus, Comput. Appl. Biosci. 5 (1989), 205-210.
20. H. Mannila and K. J. Räihä. On query languages for the p-string data model, in (H. Kangassalo, S. Ohsuga, and H. Jaakkola, Eds.), "Information Modelling and Knowledge Bases," pp. 469-482. IOS Press, Amsterdam, 1990.
21. P. Materna, P. Sgall, and Z. Hajicova, Linguistic constructions in transparent intensional logic, Prague Bull. Math. Linguistics, 1985, pp. 27-32.
22. T. Przytycka, Sparse dynamic programming for maximum agreement subtree problem, in "Mathematical Hierarchies and Biology," (B. Mirkin, F. R. McMorris, F. S. Roberts, and A. Rzhetsky, Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 249-264, American Mathematical Society, Providence, RI, 1997.
23. B. Shapiro and K. Zhang, Comparing multiple RNA secondary structures using tree comparisons, Comput. Appl. Biosci. (1990), 309-318.
24. M. Steel and T. J. Warnow, Kaikoura tree theorems: Computing the maximum agreement subtree, Inform. Process. Lett. 48 (1993), 77-82.
25. Y. Takahashi, Y. Satoh, H. Suzuki, and S. Sasaki, Recognition of largest common structural fragment among a variety of chemical structures, Anal. Sci. (1987), 23-28.
26. T. Tokuyama and J. Nakano, Efficient algorithms for the Hitchcock transportation problems, SIAM J. Comput. 24, No. 3 (1995), 563-578.
27. T. Tokuyama and J. Nakano, Geometric algorithms for the minimum cost assignment problem, Random Structures Algorithms 6 (1995), 393-406.