Baroni Mihaela, Semple Charles, Steel Mike
Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand.
Syst Biol. 2006 Feb;55(1):46-56. doi: 10.1080/10635150500431197.
We describe some new and recent results that allow for the analysis and representation of reticulate evolution by non-tree networks. In particular, we (1) present a simple result to show that, despite the presence of reticulation, there is always a well-defined underlying tree that corresponds to those parts of life that do not have a history of reticulation; (2) describe and apply new theory for determining the smallest number of hybridization events required to explain conflicting gene trees; and (3) present a new algorithm to determine whether an arbitrary rooted network can be realized by contemporaneous reticulation events. We illustrate these results with examples. [Directed acyclic graph; reticulate evolution; hybrid species; sub-tree prune and re-graft.].
我们描述了一些新的和最近的结果,这些结果允许通过非树形网络对网状进化进行分析和表示。具体而言,我们:(1)给出一个简单的结果,以表明尽管存在网状结构,但总是存在一个明确的基础树,它对应于那些没有网状进化历史的生命部分;(2)描述并应用新理论来确定解释冲突基因树所需的最少杂交事件数量;(3)提出一种新算法,以确定任意有根网络是否可通过同期网状事件实现。我们用实例说明了这些结果。[有向无环图;网状进化;杂交物种;子树剪接与重接。]