Constructing Phylogenetic Networks Based on the Isomorphism of Datasets

Constructing rooted phylogenetic networks from rooted phylogenetic trees has become an important problem in molecular evolution. So far, many methods have been presented in this area, in which most efficient methods are based on the incompatible graph, such as the CASS, the LNETWORK, and the BIMLR. This paper will research the commonness of the methods based on the incompatible graph, the relationship between incompatible graph and the phylogenetic network, and the topologies of incompatible graphs. We can find out all the simplest datasets for a topology.. and construct a network for every dataset. For any one dataset L, we can compute a network from the network representing the simplest dataset which is isomorphic to L. This process will save more time for the algorithms when constructing networks.