A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman, Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions, SIAM Journal on Computing, vol.10, issue.3, p.405421, 1981.
DOI : 10.1137/0210030

O. R. Bininda-emonds, Phylogenetic supertrees: combining information to reveal the tree of life, 2004.
DOI : 10.1007/978-1-4020-2330-9

O. R. Bininda-emonds, J. L. Gittleman, and M. A. Steel, The (Super)Tree of Life: Procedures, Problems, and Prospects, Annual Review of Ecology and Systematics, vol.33, issue.1, p.265289, 2002.
DOI : 10.1146/annurev.ecolsys.33.010802.150511

H. L. Bodlaender, P. G. Drange, M. S. Dregi, F. V. Fomin, D. Lokshtanov et al., An O(c k n) 5-Approximation Algorithm for Treewidth, Proc. of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), p.499508, 2013.
DOI : 10.1109/focs.2013.60
URL : http://arxiv.org/abs/1304.6321

D. Bryant and J. Lagergren, Compatibility of unrooted phylogenetic trees is FPT, Theoretical Computer Science, vol.351, issue.3, p.296302, 2006.
DOI : 10.1016/j.tcs.2005.10.033

A. Cayley, A theorem on trees, Quarterly Journal of Mathematics, vol.23, p.376378, 1889.
DOI : 10.1017/CBO9780511703799.010

. Wojtaszczyk, Solving connectivity problems parameterized by treewidth in single exponential time, Proc. of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), p.150159, 2011.

F. Delsuc, H. Brinkmann, and H. Philippe, Phylogenomics and the reconstruction of the tree of life, Nature Reviews Genetics, vol.3, issue.5, p.361375, 2005.
DOI : 10.1038/nrg1603
URL : https://hal.archives-ouvertes.fr/halsde-00193293

M. Frick and M. Grohe, The complexity of rst-order and monadic second-order logic revisited, Annals of Pure and Applied Logic, vol.130, pp.1-3331, 2004.

A. D. Gordon, Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves, Journal of Classification, vol.46, issue.2, p.335348, 1986.
DOI : 10.1007/BF01894195

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the exponential time hypothesis, Bulletin of the EATCS, vol.105, p.4172, 2011.

W. Maddison, RECONSTRUCTING CHARACTER EVOLUTION ON POLYTOMOUS CLADOGRAMS, Cladistics, vol.91, issue.4, p.365377, 1989.
DOI : 10.1111/j.1096-0031.1989.tb00569.x

M. Ng and N. C. Wormald, Reconstruction of rooted trees from subtrees, Discrete Applied Mathematics, vol.69, issue.1-2, p.1931, 1996.
DOI : 10.1016/0166-218X(95)00074-2

C. Scornavacca, Supertree methods for phylogenomics, II-Sciences et Techniques du Languedoc, 2009.
URL : https://hal.archives-ouvertes.fr/tel-00842893

C. Scornavacca, L. Van-iersel, S. Kelk, and D. Bryant, The agreement problem for unrooted phylogenetic trees is FPT, Journal of Graph Algorithms and Applications, vol.18, issue.3, p.385392, 2014.
DOI : 10.7155/jgaa.00327

M. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, Journal of Classification, vol.2, issue.2, p.91116, 1992.
DOI : 10.1007/BF02618470