conflicting
with one another, i.e. they cannot be integrated into a single phylogenetic tree. Phylogenetic networks
have become an important tool in molecular evolution, and rooted phylogenetic networks are able
to represent conflicting rooted phylogenetic trees. Hence, the development of appropriatemethods to compute
rooted phylogenetic networks from rooted phylogenetic trees has attracted considerable research
interest of late. The CASS algorithm proposed by van Iersel et al. is able to construct much simpler networks
than other available methods, but it is extremely slow, and the networks it constructs are dependent on
the order of the input data. Here, we introduce an improved CASS algorithm, BIMLR. We show that BIMLR
is faster than CASS and less dependent on the input data order. Moreover, BIMLR is able to construct much
simpler networks than almost all other methods. BIMLR is available at http://nclab.hit.edu.cn/wangjua