Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 361-372

  Hoang, Viet Tung ^a,b   Sung, Wing Kin ^a,b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

Maximum agreement supertree; Maximum compatible supertree

Indexed keywords

DATA MINING; POLYNOMIAL APPROXIMATION;

MAXIMUM DEGREE; NP-HARD; PHYLOGENETICS; POLYNOMIAL-TIME ALGORITHMS; SUPERTREE; SUPERTREES;

TREES (MATHEMATICS);

EID: 45749141280     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. A. Amir and D. Keselman. Maximum Agreement Subtree in a set of Evolutionary Trees: Metrics and Efficient Algorithms. SIAM Journal on Computing, 26(6):1656-1669, 1997.
2. th Symposium on Combinatorial Pattern Matching (CPM 2004), Lect. Notes in Comp. Science 3109, pp. 205-219. Springer, 2004.
3. M. Farach, T. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55:297-301, 1995.
4. G. Ganapathysaravanabavan and T. Warnow. Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In Proc. 1st Workshop on Algorithms in Bioinformatics (WABI 2001), Lect. Notes in Comp. Science 2149, pp. 156-163. Springer, 2001.
5. A. G. Gordon. Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labelled leaves. Journal of Classification, 3:335-348, 1986.
6. th Symposium on Combinatorial Pattern Matching (CPM 2007), Lect. Notes in Comp. Science 4580, pp. 274-285. Springer, 2007.
7. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71:153-169, 1996.
8. Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, and Wing-King Sung. Rooted Maximum Agreement Supertrees. Algorithmica, 43:293-307, 2005.
9. M.-Y. Kao, T.-W. Lam, W.-K. Sung, and H.-F. Ting. An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. Journal of Algorithms, 40(2):212-233, 2001.
10. Maddison, D.R., and K.-S. Schulz (eds.). The Tree of Life Web Project. http://tolweb.org, 1996-2006.