Fixed-parameter tractability of the maximum agreement supertree problem

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

Volumn 4580 LNCS, Issue , 2007, Pages 274-285

  Guillemot, Sylvain ^a   Berry, Vincent ^a  

^a UNIV MONTPELLIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

FIXED-PARAMETER TRACTABILITY; SUPERTREE PROBLEM;

PROBLEM SOLVING;

EID: 37849021365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_28     Document Type: Conference Paper

References (13)

1. Aho, A.V., Sagiv, Y., Szymanski, T.C., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing 10(3), 405-421 (1981)
2. Xia, Y., Yang, Y.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Transactions on Knowledge and Data Engineering 17(2), 190-202 (2005)
3. Gordon, A.G.: Consensus supertrees: the synthesis of rooted trees containing over-lapping sets of labelled leaves. Journal of Classification 3, 335-348 (1986)
4. Ranwez, V., Berry, V., Criscuolo, A., Guillemot, S., Douzery, E.: Vote or veto: desirable properties for supertree methods, submitted to syst. biol. LIRMM (2007)
5. Jansson, J., Ng, J.H.K., Sadakane, K., Sung, W.K.: Rooted Maximum Agreement Supertrees. Algorithmica 4(43), 293-307 (2005)
6. Berry, V., Nicolas, F.: Maximum agreement and compatible supertrees. Journal of Discrete Algorithms (in press 2007)
7. Kao, M.Y.: Encyclopedia of algorithms (2007) http://refworks.springer. com/algorithms/
8. Steel, M., Warnow, T.: Kaikoura tree theorems: computing the maximum agreement subtree. Information Processing Letters 48(2), 77-82 (1993)
9. Henzinger, M., King, V., Warnow, T.: Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. Algorithmica 24(1), 1-13 (1999)
10. Guillemot, S., Berry, V.: Fixed-parameter tractability of the maximum agreement supertree problem. Technical report, LIRMM (2007)
11. Bandelt, H., Dress, A.: Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics 7, 309-343 (1986)
12. Fernau, H.: Parameterized algorithmics: A graph-theoretic approach. Habilitationsschrift, Universität Tübingen, Germany (2005)
13. Gramm, J., Niedermeier, R.: A fixed-parameter algorithm for minimum quartet inconsistency. Journal of Computer and System Sciences 67(4), 723-741 (2003)