Weighted quartets phylogenetics

Systematic Biology

Volumn 64, Issue 2, 2015, Pages 233-242

  Avni, Eliran ^a   Cohen, Reuven ^b   Snir, Sagi ^a  

^a UNIVERSITY OF HAIFA   (Israel)

^b KINNERET COLLEGE ON THE SEA OF GALILEE   (Israel)

Author keywords

Phylogenetic reconstruction; Quartet maxcut; Supertree reconstruction; Weighted quartet trees; Weighted tree similarity

Indexed keywords

CYANOBACTERIA;

BIOLOGICAL MODEL; CLASSIFICATION; COMPUTER PROGRAM; CYANOBACTERIUM; PHYLOGENY; PROCEDURES;

CLASSIFICATION; CYANOBACTERIA; MODELS, BIOLOGICAL; PHYLOGENY; SOFTWARE;

EID: 84927677447     PISSN: 10635157     EISSN: 1076836X     Source Type: Journal    
DOI: 10.1093/sysbio/syu087     Document Type: Article

References (40)

1. Alon N., Snir S., Yuster R. 2014. On the compatibility of quartet trees. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA; 2014, 535-545.
2. Bandelt H.J., Dress A. 1986. Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7:309-343.
3. Baum B.R. 1992. Combining trees as a way of combining data sets for phylogenetic inference. Taxon. 41:3-10.
4. Berry V., Gascuel O. 2001. Inferring evolutionary trees with strong combinatorial evidence. Theor. Comput. Sci. 240:271-298.
5. Bryant D., Steel M.A. 2001. Constructing optimal trees from quartets. J. Algorithms. 38:237-259.
6. Buneman P. 1971. The recovery of trees from measures of dissimilarity. In: F.R. Hodson, Kendall D.G., Tautu P., editors. Anglo-Romanian Conference on Mathematics in the Archaeological and Historical Sciences. Mamaia, Romania: Edinburgh University Press p. 387-395.
7. Chifman J., Kubatko L. 2014. Quartet inference from SNP data under the coalescent model. Bioinformatics. doi:10.1093/bioinformatics/btu530.
8. Chor B., Snir S. 2004. Molecular clock fork phylogenies: Closed form analytic maximum likelihood solutions. Syst. Biol. 53:963-967.
9. Chor B., Hendy M., Holland B., Penny D. 2000. Multiple maxima of likelihood in phylogenetic trees: An analytic approach. Mol. Biol. Evol. 17:1529-1541. Earlier version appeared in RECOMB 2000.
10. Chor B., Khetan A., Snir S. 2006. Maximum likelihood molecular clock comb: Analytic solutions. Jour. Comput. Biol. Earlier version appeared in RECOMB 2003.
11. Daskalakis C., Mossel E., Roch S. 2011. Phylogenies without branch bounds: Contracting the short, pruning the deep. SIAM J. Discrete Math. 25:872-893.
12. Doolittle W.F. 1999. Phylogenetic classification and the universal tree. Science. 284:2124-9.
13. Erdös P., Steel M., Szekely L., Warnow T. 1999. A few logs suffice to build (almost) all trees (i). Random Struct. Algor. 14:153-184.
14. Estabrook G.F. 1985. Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst. Biol. 34:193-200.
15. Felsenstein J. 1989. PHYLIP - phylogenetic inference package, (version 3.2). Cladistics 5:164-166.
16. Garey M.R., Johnson D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company.
17. Gronau I., Moran S., Snir S. 2008. Fast and reliable reconstruction of phylogenetic trees with very short branches. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), p. 379-388.
18. Holland B.R., Jarvis P.D., Sumner J.G. 2013. Low-parameter phylogenetic inference under the general markov model. Syst. Biol. 62:78-92.
19. Jiang T., Kearney P.E., Li M. 2000. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J. Comput. 30:1942-1961.
20. Jin G., Nakhleh L., Snir S., Tuller T. 2007. Inferring phylogenetic networks by the maximum parsimony criterion: a case study. Mol. Biol. Evol. 24:324-337.
21. Koonin E.V., Makarova K.S., Aravind L. 2001. Horizontal gene transfer in prokaryotes: quantification and classification. Annu. Rev. Microbiol. 55:709-742.
22. Ochman H., Lawrence J.G., Groisman E.A. 2000. Lateral gene transfer and the nature of bacterial innovation. Nature. 405:299-304.
23. Ragan M.A. 1992. Matrix representation in reconstructing phylogenetic-relationships among the eukaryotes. Biosystems. 28:47-55.
24. Ranwez V., Gascuel O. 2001. Quartet-based phylogenetic inference: Improvements and limits. Mole. Biol. Evol. 18:1103-1116.
25. Robinson D.R., Foulds L.R. 1981. Comparison of phylogenetic trees. Math. Biosci. 53:131-147.
26. Roch S., Snir S. 2012. Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: A probabilistic analysis. In: RECOMB, p. 224-238.
27. Sanderson M.J. 2003. r8s: inferring absolute rates of molecular evolution and divergence times in the absence of a molecular clock. Bioinformatics. 19:301-302. doi:10.1093/bioinformatics/19.2.301. URL http://bioinformatics.oxfordjournals.org/content/19/2/301. abstract. Available at http://ginger.ucdavis.edu/r8s/
28. Snir S., Rao S. 2006. Using max cut to enhance rooted trees consistency. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 3:323-333. Preliminary version appeared in WABI 2005.
29. Snir S., Rao S. 2010. Quartets maxcut: A divide and conquer quartets algorithm. Trans. Comput. Biol. Bioinform. 7:714-718.
30. Snir S., Rao S. 2012. Quartet maxcut: A fast algorithm for amalgamating quartet trees. Mole. Phylogenet. Evol. 62:1-8.
31. Snir S., Yuster R. 2012. Reconstructing approximate phylogenetic trees from quartet samples. SIAM J. Comput. 41:1466-1480. Preliminary version appeared in SODA 2010.
32. Snir S., Warnow T., Rao S. 2008. Short quartet puzzling: A new quartet-based phylogeny reconstruction algorithm. J. Comput. Biol. 1:91-103.
33. Steel M. 1992. The complexity of reconstructing trees from qualitative characters and subtress. J. Classif. 9:91-116.
34. Strimmer K., von Haeseler A. 1996. Quartet puzzling: A quartet maximum-likelihood method for reconstructing tree topologies. Mole. Biol. Evol. 13:964-969. Available from URL ftp://ftp.ebi.ac.uk/pub/software/unix/puzzle/.
35. Strimmer K., Goldman N., von Haeseler A. 1997. Bayesian probabilities and quartet puzzling. Mole. Biol. Evol. 14:210-211.
36. Swenson M.S., Suri R., Linder C.R., Warnow T. 2011. An experimental study of quartets maxcut and other supertree methods. Algorithms for Mole. Biol. 6:7.
37. Swenson M.S., Suri R., Linder C.R., Warnow T. 2012. Superfine: fast and accurate supertree estimation. Syst. Biol. 61:214-227. doi:10.1093/sysbio/syr092.
38. Swofford D.L. 1998. PAUP∗beta, Sinauer, Sunderland, Mass.
39. Yap W.H., Zhang Z., Wang Y. 1999. Distinct types of RRNA operons exist in the genome of the actinomycete thermomonospora chromogena and evidence for horizontal transfer of an entire RRNA operon. J. Bacteriol. 181:5201-5209.
40. Zhaxybayeva O., Gogarten J.P., Charlebois R.L., Doolittle W.F., Papke R.T. 2006. Phylogenetic analyses of cyanobacterial genomes: quantification of horizontal gene transfer events. Genome. Res. 16:1099-1108.