Kelk, Steven; Linz, Simone A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees. (English) Zbl 1430.68130 SIAM J. Discrete Math. 33, No. 3, 1556-1574 (2019). MSC: 68Q27 05C05 68W40 92D15 PDF BibTeX XML Cite \textit{S. Kelk} and \textit{S. Linz}, SIAM J. Discrete Math. 33, No. 3, 1556--1574 (2019; Zbl 1430.68130) Full Text: DOI arXiv
Hallett, Michael; McCartin, Catherine A faster FPT algorithm for the maximum agreement forest problem. (English) Zbl 1148.68049 Theory Comput. Syst. 41, No. 3, 539-550 (2007). MSC: 68W05 05C05 05C85 68Q25 68R10 92D15 PDF BibTeX XML Cite \textit{M. Hallett} and \textit{C. McCartin}, Theory Comput. Syst. 41, No. 3, 539--550 (2007; Zbl 1148.68049) Full Text: DOI
Song, Yun S. On the combinatorics of rooted binary phylogenetic trees. (English) Zbl 1045.05031 Ann. Comb. 7, No. 3, 365-379 (2003). Reviewer: Péter L. Erdős (Budapest) MSC: 05C05 92D15 PDF BibTeX XML Cite \textit{Y. S. Song}, Ann. Comb. 7, No. 3, 365--379 (2003; Zbl 1045.05031) Full Text: DOI