A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees

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

Volumn 1643, Issue , 1999, Pages 438-449

  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

ALGORITHMS; DOMAIN DECOMPOSITION METHODS; FORESTRY; GRAPH THEORY;

BIPARTITE GRAPHS; BIPARTITE MATCHINGS; CARDINALITY MATCHING; DECOMPOSITION THEOREMS; EVOLUTIONARY TREE; MAXIMUM AGREEMENT SUBTREES; MAXIMUM WEIGHT MATCHING; POSITIVE INTEGERS;

EVOLUTIONARY ALGORITHMS;

EID: 84958038951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_38     Document Type: Conference Paper

References (26)

1. R. Agarwala and D. FernÁndez-Baca, A polynomial-time algorithm for the perfect phytogeny problem when the number of character states is fixed, SIAM Journal on Computing, 23 (1994), pp. 1216-1224.
2. U. L. Bodlaender, M. R. Fellows, and T. J. Warnow, Two strikes against perfect phytogeny, in Lecture Notes in Computer Science 623: Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Springer-Verlag, New York, NY, 1992, pp. 273-283.
3. J. Bondy and и. Murty, Graph Theory with Applications, North-Holland, New York, NY, 1976.
4. 2.5) time algorithms for the subgraph homeomorphismproblem on trees, Journal of Algorithms, 8 (1987), pp. 106-112.
5. R. Cole and R. Hariharan, An O (n log n) algorithm for the maximum agreement subtree problem for binary trees, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 323-332.
6. T. U. Cormen, C. L. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
7. M. Farach, T. M. Przytycka, and M. Thorup, Computing the agreement of trees with bounded degrees, in Lecture Notes in Computer Science 979: Proceedings of the 3rd Annual European Symposium on Algorithms, P. Spirakis, ed., Springer-Verlag, New York, NY, 1995, pp. 381-393.
8. M. Farach and M. Thorup, Fast comparison of evolutionary trees, Information and Computation, 123 (1995), pp. 29-37.
9. M. Farach and M. Thorup, Sparse dynamic programming for evolutionary-tree comparison, SIAM Journal on Computing, 26 (1997), pp. 210-230.
10. T. Feder and R. Motwani, Clique partitions, graph compression and speeding-up algorithms, Journal of Computer and System Sciences, 51 (1995), pp. 261-272.
11. C. R. Finden and A. D. Gordon, Obtaining common pruned trees, Journal of Classification, 2 (1985), pp. 255-276.
12. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, 34 (1987), pp. 596-615.
13. H. N. Gabow, Scaling algorithms for network problems, Journal of Computer and System Sciences, 31 (1985), pp. 148-168.
14. U. N. Gabow and R. E. Tarjan, Faster scaling algorithms for network problems, SIAM Journal on Computing, 18 (1989), pp. 1013-1036.
15. Z. Galil, Efficient algorithms for finding maximum matching in graphs, ACM Computing Surveys, 18 (1986), pp. 23-38.
16. A. M. H. Gerards, Matching, in Handbooks in Operations Reserach and Management Science, volume 7, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds., Elsevier Science, 1995, pp. 135-224.
17. D. GusAeld, Efficient algorithms for inferring evolutionary trees, Networks, 21 (1991), pp. 19-28.
18. 5/2 algorithm for maximum matching in bipartite graphs, SIAM Journal on Computing, 2 (1973), pp. 225-231.
19. M. Y. Kao, Tree contractions and evolutionary trees, SIAM Journal on Computing, 27 (1998), pp. 1592-1616.
20. M. Y. Kao, T. W. Lam, T. M. Przytycka, W. K. Sung, and H. F. Ting, General techniques for comparing unrooted evolutionary trees, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, 4-6 May 1997, pp. 54-65.
21. M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting, All-cavitymaximummatchings, in Lecture Notes in Computer Science 1350: Proceedings of the 8th Annual International Symposium on Algorithms and Computation, 1997, pp. 364-373.
22. M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting, Cavity matchings, label compressions, and unrooted evolutionary trees, 1997. Submitted for journal publication.
23. H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, 2 (1955), pp. 83-97.
24. T. W. Lam, W. K. Sung, and H. F. Ting, Computing the unrooted maximum agreement subtree in sub-quadratic time, Nordic Journal of Computing, 3 (1996), pp. 295-322.
25. M. Steel and T. Warnow, Kaikoura tree theorems: Computing the maximum agreement subtree, Information Processing Letters, 48 (1993), pp. 77-82.
26. L. Wang, T. Jiang, and E. Lawler, Approximation algorithms for tree alignment with a givenphylogeny, Algorithmica, 16 (1996), pp. 302-315.