title: A new algorithm to construct phylogenetic networks from trees.
abstract: Developing appropriate methods for constructing phylogenetic networks from tree sets is an important problem, and much research is currently being undertaken in this area. BIMLR is an algorithm that constructs phylogenetic networks from tree sets. The algorithm can construct a much simpler network than other available methods. Here, we introduce an improved version of the BIMLR algorithm, QuickCass. QuickCass changes the selection strategy of the labels of leaves below the reticulate nodes, i.e., the nodes with an indegree of at least 2 in BIMLR. We show that QuickCass can construct simpler phylogenetic networks than BIMLR. Furthermore, we show that QuickCass is a polynomial-time algorithm when the output network that is constructed by QuickCass is binary.
authors.affiliation: College of Computer Science, Inner Mongolia University, Hohhot, Inner Mongolia, China wangjuanangle@hit.edu.cn.
authors.forename: J
authors.initials: J
authors.lastname: Wang
mesh_terms: D000465:Algorithms; D030541:Databases, Genetic; D010802:Phylogeny; D012984:Software; D014197:Trees / Q000145:classification* / Q000235:genetics*