Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
暂无分享,去创建一个
[1] P. Buneman. The Recovery of Trees from Measures of Dissimilarity , 1971 .
[2] Charles Semple,et al. On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance , 2005 .
[3] Rita Casadio,et al. Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.
[4] Tao Jiang,et al. On the Complexity of Comparing Evolutionary Trees , 1996, Discret. Appl. Math..
[5] Yoshiko Wakabayashi,et al. The maximum agreement forest problem: Approximation algorithms and computational experiments , 2007, Theor. Comput. Sci..
[6] Norbert Zeh,et al. Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees , 2013, Algorithmica.
[7] F. Sperling. Molecular Systematics, 2nd ed. , 1997 .
[8] Maria Luisa Bonet,et al. Approximating Subtree Distances Between Phylogenies , 2006, J. Comput. Biol..
[9] Yoshiko Wakabayashi,et al. Some Approximation Results for the Maximum Agreement Forest Problem , 2001, RANDOM-APPROX.
[10] Charles Semple,et al. A 3-approximation algorithm for the subtree distance between phylogenies , 2008, J. Discrete Algorithms.
[11] J. Tromp,et al. On the nearest neighbour interchange distance between evolutionary trees. , 1996, Journal of theoretical biology.
[12] Mihalis Yannakakis,et al. Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems , 2007, APPROX-RANDOM.
[13] D. Robinson,et al. Comparison of phylogenetic trees , 1981 .
[14] Norbert Zeh,et al. A Unifying View on Approximation and FPT of Agreement Forests , 2009, WABI.