Abstract
We present the QuickQuartet algorithm for computing the all-to-all quartet distance for large evolutionary tree collections. By leveraging the relationship between bipartitions and quartets, our approach significantly improves upon the performance of existing quartet distance algorithms. To explore QuickQuartet’s performance, sets of biological data containing 20,000 and 33,306 trees over 150 taxa and 567 taxa, respectively are analyzed. Experimental results show that QuickQuartet is up to 100 times faster than existing methods. With the availability of QuickQuartet, the use of quartet distance as a tool for analysis of evolutionary relationships becomes a practical tool for biologists to use in order to gain new insights regarding their large tree collections.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brodal, G.S., Fagerberg, R., Pedersen, C.N.S.: Computing the Quartet Distance between Evolutionary Trees in Time O(nlog2 n). In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 731–742. Springer, Heidelberg (2001)
Davis, B.W., Li, G., Murphy, W.J.: Supermatrix and species tree methods resolve phylogenetic relationships within the big cats, panthera (carnivora: Felidae). Molecular Phylogenetics and Evolution 56(1), 64–76 (2010)
Huelsenbeck, J.P., Ronquist, F.: MRBAYES: Bayesian inference of phylogenetic trees. Bioinformatics 17(8), 754–755 (2001)
Lewis, L.A., Lewis, P.O.: Unearthing the molecular phylodiversity of desert soil green algae (chlorophyta). Syst. Bio. 54(6), 936–947 (2005)
Mailund, T., Pedersen, C.N.S.: QDist–quartet distance between evolutionary trees. Bioinformatics 20(10), 1636–1637 (2004)
Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences 53, 131–147 (1981)
Schmidt, H.A., Strimmer, K., Vingron, M., von Haeseler, A.: Tree-puzzle: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 18(3), 502–504 (2002)
Soltis, D.E., Gitzendanner, M.A., Soltis, P.S.: A 567-taxon data set for angiosperms: The challenges posed by bayesian analyses of large data sets. Int. J. Plant Sci. 168(2), 137–157 (2007)
Steel, M.A., Penny, D.: Distributions of tree comparision metrics—some new results. Systematic Biology 42(2), 126–141 (1993)
Stissing, M., Mailund, T., Pedersen, C., Brodal, G., Fagerberg, R.: Computing the all-pairs quartet distance on a set of evolutionary trees. Journal of Bioinformatics & Computational Biology 6(1), 37–50 (2008)
Sul, S.-J., Williams, T.L.: An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 793–804. Springer, Heidelberg (2008)
Swofford, D.L.: PAUP*: Phylogenetic analysis using parsimony (and other methods), Sinauer Associates, Underland, Massachusetts, Version 4.0 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crosby, R.W., Williams, T.L. (2012). A Fast Algorithm for Computing the Quartet Distance for Large Sets of Evolutionary Trees. In: Bleris, L., Măndoiu, I., Schwartz, R., Wang, J. (eds) Bioinformatics Research and Applications. ISBRA 2012. Lecture Notes in Computer Science(), vol 7292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30191-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-30191-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30190-2
Online ISBN: 978-3-642-30191-9
eBook Packages: Computer ScienceComputer Science (R0)