Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms, SIAM Journal on Computing, vol.26, issue.6, pp.1656-1669, 1997. ,
DOI : 10.1137/S0097539794269461
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions, SIAM Journal on Computing, vol.10, issue.3, pp.405-421, 1981. ,
DOI : 10.1137/0210030
Combining Trees as a Way of Combining Data Sets for Phylogenetic Inference, and the Desirability of Combining Gene Trees, Taxon, vol.41, issue.1, pp.3-10, 1992. ,
DOI : 10.2307/1222480
Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves, Journal of Classification, vol.46, issue.2, pp.335-346, 1986. ,
DOI : 10.1007/BF01894195
Finding Largest Subtrees and Smallest Supertrees, Algorithmica, vol.21, issue.2, pp.183-210, 1998. ,
DOI : 10.1007/PL00009212
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5768
Efficient algorithms for inferring evolutionary trees. Networks, pp.19-28, 1991. ,
DOI : 10.1002/net.3230210104
Finding a maximum compatible tree is NP-hard for sequences and trees, Applied Mathematics Letters, vol.9, issue.2, pp.55-59, 1996. ,
DOI : 10.1016/0893-9659(96)00012-2
A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees, Proc. of the 8th Ann. Europ. Symp. Alg. (ESA), pp.438-449, 1999. ,
A Faster and Unifying Algorithm for Comparing Trees, Proc. of the 11th Ann. Symp. on Comb. Patt. Match. (CPM'00), pp.129-142, 2000. ,
DOI : 10.1007/3-540-45123-4_13
An efficient fixed-parameter algorithm for 3-Hitting Set, Journal of Discrete Algorithms, vol.1, issue.1, pp.89-102, 2003. ,
DOI : 10.1016/S1570-8667(03)00009-1
URL : http://doi.org/10.1016/s1570-8667(03)00009-1
Modified Mincut Supertrees, Proc. of the Workshop on Algorithms for Bioinformatics (WABI'02), pp.538-551, 2002. ,
DOI : 10.1007/3-540-45784-4_41
A Modification to Baum and Ragan's Method for Combining Phylogenetic Trees, Systematic Biology, vol.44, issue.2, pp.251-255, 1995. ,
DOI : 10.1093/sysbio/44.2.251
URL : http://sysbio.oxfordjournals.org/cgi/content/short/44/2/251
Matrix representation in reconstructing phylogenetic relationships among the eukaryotes, Biosystems, vol.28, issue.1-3, pp.47-55, 1992. ,
DOI : 10.1016/0303-2647(92)90007-L
Matrix Representation of Trees, Redundancy, and Weighting, Systematic Biology, vol.45, issue.2, pp.247-253, 1996. ,
DOI : 10.1093/sysbio/45.2.247
A supertree method for rooted trees, Discrete Applied Mathematics, vol.105, issue.1-3, pp.147-158, 2000. ,
DOI : 10.1016/S0166-218X(00)00202-X
Kaikoura tree theorems: Computing the maximum agreement subtree, Information Processing Letters, vol.48, issue.2, pp.77-82, 1993. ,
DOI : 10.1016/0020-0190(93)90181-8
A view of supertrees methods, pp.185-194, 2003. ,
Tree Compatibility and Inferring Evolutionary History, Journal of Algorithms, vol.16, issue.3, pp.388-407, 1994. ,
DOI : 10.1006/jagm.1994.1018
Interrelationships of the Platyhelminthes, chapter 27, Towards a phylogenetic supertree of Platyhelminthes, 2001. ,