Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees
The Maximun Agreement Forest problem (maf) asks for a largest common subforest of a collection of phylogenetic trees. The maf problem on two binary phylogenetic trees has been studied extensively in the literature. In this paper, we present the first group of fixed-parameter tractable algorithms for the maf problem on multiple (i.e., two or more) binary phylogenetic trees. Our techniques work fine for the problem for both rooted trees and unrooted trees. The computational complexity of our algorithms is comparable with that of the known algorithms for two trees, and is independent of the number of phylogenetic trees for which a maximum agreement forest is constructed.
Unable to display preview. Download preview PDF.
- 5.Chen, J., Fan, J.-H., Sze, S.-H.: Improved algoithms for the maximum agreement forest problem on general trees. In: WG 2013 (submitted, 2013)Google Scholar
- 9.Hodson, F., Kendall, D., Tauta, P. (eds.): The recovery of trees from measures of dissimilarity. Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)Google Scholar
- 13.Swofford, D., Olsen, G., Waddell, P., Hillis, D.: Phylogenetic inference. In: Molecular Systematics, 2nd edn., pp. 407–513. Sinauer Associates (1996)Google Scholar
- 14.Whidden, C., Beiko, R., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. CoRR. abs/1108.2664 (2011)Google Scholar