Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles
We consider a generalization of the rooted triplet distance between two phylogenetic trees to two phylogenetic networks. We show that if each of the two given phylogenetic networks is a so-called galled tree with n leaves then the rooted triplet distance can be computed in o(n2.688) time. Our upper bound is obtained by reducing the problem of computing the rooted triplet distance to that of counting monochromatic and almost- monochromatic triangles in an undirected, edge-colored graph. To count different types of colored triangles in a graph efficiently, we extend an existing technique based on matrix multiplication and obtain several new related results that may be of independent interest.
Unable to display preview. Download preview PDF.
- 7.Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Inc., Sunderland (2004)Google Scholar
- 10.Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press (2010)Google Scholar
- 13.Morrison, D.: Introduction to Phylogenetic Networks. RJR Productions (2011)Google Scholar
- 15.Nielsen, J., Kristensen, A.K., Mailund, T., Pedersen, C.N.S.: A sub-cubic time algorithm for computing the quartet distance between two general trees. Algorithms for Molecular Biology 6, Article 15 (2011)Google Scholar
- 16.Stothers, A.J.: On the Complexity of Matrix Multiplication. PhD thesis, University of Edinburgh (2010)Google Scholar
- 19.Vassilevska, V., Williams, R., Yuster, R.: Finding Heaviest H-Subgraphs in Real Weighted Graphs, with Applications. ACM Transactions on Algorithms 6(3), Article 44 (2010)Google Scholar
- 20.Vassilevska Williams, V.: Breaking the Coppersmith-Winograd barrier. UC Berkely and Stanford University (2011) (manuscript)Google Scholar