Chan Yao-Ban, Ranwez Vincent, Scornavacca Céline
School of Mathematics and Physics, The University of Queensland, St. Lucia, QLD, 4072, Australia.
Montpellier SupAgro (UMR AGAP), 2 place Pierre Viala, Montpellier Cedex 02, 34060, France.
J Math Biol. 2015 Nov;71(5):1179-209. doi: 10.1007/s00285-014-0851-2. Epub 2014 Dec 14.
Reconciliations between gene and species trees have important applications in the study of genome evolution (e.g. sequence orthology prediction or quantification of transfer events). While numerous methods have been proposed to infer them, little has been done to study the underlying reconciliation space. In this paper, we characterise the reconciliation space for two evolutionary models: the [Formula: see text] (duplication, loss and transfer) model and a variant of it-the no-[Formula: see text] model-which does not allow [Formula: see text] events (a transfer immediately followed by a loss). We provide formulae to compute the size of the corresponding spaces and define a set of transformation operators sufficient to explore the entire reconciliation space. We also define a distance between two reconciliations as the minimal number of operations needed to transform one into the other and prove that this distance is easily computable in the no-[Formula: see text] model. Computing this distance in the [Formula: see text] model is more difficult and it is an open question whether it is NP-hard or not. This work constitutes an important step toward reconciliation space characterisation and reconciliation comparison, needed to better assess the performance of reconciliation inference methods through simulations.
基因树与物种树之间的一致性在基因组进化研究中具有重要应用(例如序列直系同源预测或转移事件的量化)。虽然已经提出了许多方法来推断它们,但对于潜在的一致性空间的研究却很少。在本文中,我们刻画了两种进化模型的一致性空间:[公式:见正文](复制、丢失和转移)模型及其一个变体——无-[公式:见正文]模型,该模型不允许[公式:见正文]事件(即紧接着一次丢失的一次转移)。我们提供了计算相应空间大小的公式,并定义了一组足以探索整个一致性空间的变换算子。我们还将两个一致性之间的距离定义为将一个变换为另一个所需的最少操作数,并证明在无-[公式:见正文]模型中这个距离很容易计算。在[公式:见正文]模型中计算这个距离则更困难,它是否为NP难问题仍是一个悬而未决的问题。这项工作是朝着一致性空间刻画和一致性比较迈出的重要一步,这对于通过模拟更好地评估一致性推断方法的性能是必要的。