Abstract
We study the agreement supertree approach for combining rooted phylogenetic trees when the input trees do not fully agree on the relative positions of the taxa. Two approaches to dealing with such conflicting input trees are considered. The first is to contract a set of edges in the input trees so that the resulting trees have an agreement supertree. We show that this problem is NP-complete and give an FPT algorithm for the problem parameterized by the number of input trees and the number of edges contracted. The second approach is to remove a set of taxa from the input trees so that the resulting trees have an agreement supertree. An FPT algorithm for this problem when the input trees are all binary was given by Guillemot and Berry (2010). We give an FPT algorithm for the more general case when the input trees have arbitrary degree.
This work was supported in part by the National Science Foundation under grants CCF-1017189 and DEB-0829674.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10(3), 405–421 (1981)
Berry, V., Nicolas, F.: Maximum agreement and compatible supertrees. J. Discrete Algorithms 5(3), 564–591 (2007)
Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Ser. on Comp. Biol., vol. 4. Springer (2004)
Bryant, D.: Optimal Agreement Supertrees. In: Gascuel, O., Sagot, M.-F. (eds.) JOBIM 2000. LNCS, vol. 2066, pp. 24–31. Springer, Heidelberg (2001)
Gordon, A.D.: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labelled leaves. J. Classification 9, 335–348 (1986)
Guillemot, S., Berry, V.: Fixed-parameter tractability of the maximum agreement supertree problem. IEEE/ACM Trans. Comput. Biology Bioinform. 7(2), 342–353 (2010)
Hoang, V.T., Sung, W.K.: Improved algorithms for maximum agreement and compatible supertrees. Algorithmica 59(2), 195–214 (2011)
Jansson, J., Ng, J.H.K., Sadakane, K., Sung, W.K.: Rooted maximum agreement supertrees. Algorithmica 43(4), 293–307 (2005)
Kao, M.Y.: Encyclopedia of algorithms. Springer, New York (2007)
Linder, C.R., Rieseberg, L.H.: Reconstructing patterns of reticulate evolution in plants. Am. J. Bot. 91(10), 1700–1708 (2004)
Maddison, W.: Gene trees in species trees. Systematic Biology 46(3), 523–536 (1997)
Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: STOC 2011, pp. 469–478. ACM (2011)
Ng, M., Wormald, N.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69(1-2), 19–31 (1996)
Scornavacca, C.: Supertree methods for phylogenomics. Ph.D. thesis, Univ. of Montpellier II, Montpellier, France (2009)
Steel, M.A.: The complexity of reconstructing trees from qualitative characters and subtrees. J. Classification 9, 91–116 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández-Baca, D., Guillemot, S., Shutters, B., Vakati, S. (2012). Fixed-Parameter Algorithms for Finding Agreement Supertrees. In: Kärkkäinen, J., Stoye, J. (eds) Combinatorial Pattern Matching. CPM 2012. Lecture Notes in Computer Science, vol 7354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31265-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-31265-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31264-9
Online ISBN: 978-3-642-31265-6
eBook Packages: Computer ScienceComputer Science (R0)