CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2012 vol.9 Issue No.02 - March/April
Issue No.02 - March/April (2012 vol.9)
P. Phipps , Univ. of Texas at Dallas, Plano, TX, USA
S. Bereg , Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.109
We address the problem of realizing a given distance matrix by a planar phylogenetic network with a minimum number of faces. With the help of the popular software SplitsTree4, we start by approximating the distance matrix with a distance metric that is a linear combination of circular splits. The main results of this paper are the necessary and sufficient conditions for the existence of a network with a single face. We show how such a network can be constructed, and we present a heuristic for constructing a network with few faces using the first algorithm as the base case. Experimental results on biological data show that this heuristic algorithm can produce phylogenetic networks with far fewer faces than the ones computed by SplitsTree4, without affecting the approximation of the distance matrix.
Phylogeny, Measurement, Computational biology, Bioinformatics, Transmission line matrix methods, Software algorithms, History,network optimization., Computational biology, phylogenetic network, minimizing faces, split network
P. Phipps, S. Bereg, "Optimizing Phylogenetic Networks for Circular Split Systems", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, no. 2, pp. 535-547, March/April 2012, doi:10.1109/TCBB.2011.109