CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2013 vol.10 Issue No.01 - Jan.-Feb.
Issue No.01 - Jan.-Feb. (2013 vol.10)
Cuong V. Than , Dept. of Comput. Sci., Univ. of Tuebingen, Tubingen, Germany
Noah A. Rosenberg , Dept. of Biol., Stanford Univ., Stanford, CA, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2012.133
In the minimizing-deep-coalescences (MDC) approach for species tree inference, a tree that has the minimal deep coalescence cost for reconciling a collection of gene trees is taken as an estimate of the species tree topology. The MDC method possesses the desirable Pareto property, and in practice it is quite accurate and computationally efficient. Here, in order to better understand the MDC method, we investigate some properties of the deep coalescence cost. We prove that the unit neighborhood of either a rooted species tree or a rooted gene tree under the deep coalescence cost is exactly the same as the tree's unit neighborhood under the rooted nearest-neighbor interchange (NNI) distance. Next, for a fixed species tree, we obtain the maximum deep coalescence cost across all gene trees as well as the number of gene trees that achieve the maximum cost. We also study corresponding problems for a fixed gene tree.
Vegetation, Topology, Computational biology, Bioinformatics, Upper bound, Sorting, Transforms,nearest-neighbor interchange, Deep coalescence, gene tree reconcilation, incomplete lineage sorting, maximal subtrees
Cuong V. Than, Noah A. Rosenberg, "Mathematical Properties of the Deep Coalescence Cost", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, no. 1, pp. 61-72, Jan.-Feb. 2013, doi:10.1109/TCBB.2012.133