Maximum Compatible Tree
Publisher
Springer New York
Reference14 articles.
1. Berry V, Nicolas F (2006) Improved parametrized complexity of the maximum agreement subtree and maximum compatible tree problems. IEEE/ACM Trans Comput Biol Bioinformatics 3(3):289–302
2. Berry V, Nicolas F (2007) Maximum agreement and compatible supertrees. J Discret Algorithms 5(3):564–591
3. Berry V, Guillemot S, Nicolas F, Paul C (2005) On the approximation of computing evolutionary trees. In: Wang L (ed) Proceedings of the 11th annual international conference on computing and combinatorics (COCOON’05), Shanghai. LNCS, vol 3595. Springer, pp 115–125
4. Berry V, Peng ZS, Ting HF (2008) From constrained to unconstrained maximum agreement subtree in linear time. Algorithmica 50(3):369–385
5. Berry V, Guillemot S, Nicolas F, Paul C (2009) Linear time 3-approximation for the mast problem. ACM Trans. Algorithms 5(2):23:1–23:18