In this short note we prove that, given two (not necessarily binary) rooted phylogenetic trees T_1, T_2 on the same set of taxa X, where |X|=n, the hybridization number of T_1 and T_2 can be computed in time O^{*}(2^n) i.e. O(2^{n} poly(n)). The result also means that a Maximum Acyclic Agreement Forest (MAAF) can be computed within the same time bound.
@article{arxiv.1312.1255,
title = {A short note on exponential-time algorithms for hybridization number},
author = {Leo van Iersel and Steven Kelk and Nela Lekic and Leen Stougie},
journal= {arXiv preprint arXiv:1312.1255},
year = {2013}
}