solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看11327次
Classes of treebased networks. (arXiv:1810.06844v1 [q-bio.PE])
来源于:arXiv
Recently, so-called treebased phylogenetic networks have gained considerable
interest in the literature, where a treebased network is a network that can be
constructed from a phylogenetic tree, called the \emph{base tree}, by adding
additional edges. The main aim of this manuscript is to provide some sufficient
criteria for treebasedness by reducing phylogenetic networks to related graph
structures. While it is generally known that deciding whether a network is
treebased is NP-complete, one of these criteria, namely \emph{edgebasedness},
can be verified in polynomial time. Next to these edgebased networks, we
introduce further classes of treebased networks and analyze their
relationships. 查看全文>>