
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sagi Snir, Satish Rao, "Quartets MaxCut: A Divide and Conquer Quartets Algorithm," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 4, pp. 704718, OctoberDecember, 2010.  
BibTex  x  
@article{ 10.1109/TCBB.2008.133, author = {Sagi Snir and Satish Rao}, title = {Quartets MaxCut: A Divide and Conquer Quartets Algorithm}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {7}, number = {4}, issn = {15455963}, year = {2010}, pages = {704718}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.133}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Quartets MaxCut: A Divide and Conquer Quartets Algorithm IS  4 SN  15455963 SP704 EP718 EPD  704718 A1  Sagi Snir, A1  Satish Rao, PY  2010 KW  Phylogenetic reconstruction KW  quartets KW  MaxCut KW  supertree. VL  7 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] A.V. Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman, "Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions," SIAM J. Computing, vol. 10, no. 3, pp. 405421, 1981.
[2] S. Arora, S. Rao, and U. Vazirani, "Expander Flows, Geometric Embeddings and Graph Partitioning," Proc. Symp. Foundations of Computer Science (FOCS), pp. 222231, 2004.
[3] B.R. Baum, "Combining Trees as a Way of Combining Data Sets for Phylogenetic Inference," Taxon, vol. 41, pp. 310, 1992.
[4] A. BenDor, B. Chor, D. Graur, R. Ophir, and D. Pelleg, "Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships," J. Computational Biology, vol. 5, no. 3, pp. 377390, 1998, earlier version appeared in Proc. RECOMB, 1998.
[5] V. Berry and O. Gascuel, "Inferring Evolutionary Trees with Strong Combinatorial Evidence," Theoretical Computer Science, vol. 240, pp. 271298, 2001.
[6] M. Cardillo, O.R.P. Bininda Emonds, E. Boakes, and A. Purvis, "A SpeciesLevel Phylogenetic Supertree of Marsupials," J. Zoology, vol. 264, no. 1, pp. 1131, 2004.
[7] M. Casanellas and J. FernándezSánchez, "Performance of a New Invariants Method on Homogeneous and Nonhomogeneous Quartet Trees," Molecular Biology and Evolution, vol. 24, no. 1, pp. 288293, 2007.
[8] M. Casanellas, L.D. Garcia, and S. Sullivant, "Catalog of Small Trees," Algebraic Statistics for Computational Biology, L. Pachter and B. Sturmfels, eds., chapter 15, pp. 291305, Cambridge Univ. Press, 2005.
[9] B. Chor, M. Hendy, B. Holland, and D. Penny, "Multiple Maxima of Likelihood in Phylogenetic Trees: An Analytic Approach," Molecular Biology and Evolution, vol. 17, no. 10, pp. 15291541, 2000, earlier version appeared in Proc. RECOMB, 2000.
[10] B. Chor, A. Khetan, and S. Snir, "Maximum Likelihood Molecular Clock Comb: Analytic Solutions," J. Computational Biology, vol. 13, pp. 819837, 2006, Earlier Version Appeared in Proc. Seventh Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '03).
[11] B. Chor and S. Snir, "Molecular Clock Fork Phylogenies: Closed Form Analytic Maximum Likelihood Solutions," Systematic Biology, vol. 53, pp. 963967, Dec. 2004.
[12] C.J. Creevey and J.O. McInerney, "Clann: Investigating Phylogenetic Information through Supertree Analyses," Bioinformatics, vol. 21, no. 3, pp. 390392, 2005.
[13] C. Daskalakis, C. Hill, A. Jaffe, R. Mihaescu, E. Mossel, and S. Rao, "Maximal Accurate Forests from Distance Matrices," Proc. 10th Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '06), 2006.
[14] P. Erdös, M. Steel, L. Szekely, and T. Warnow, "A Few Logs Suffice to Build (Almost) all Trees (i)," Random Structures and Algorithms, vol. 14, pp. 153184, 1999.
[15] P. Erdös, M. Steel, L. Szekely, and T. Warnow, "A Few Logs Suffice to Build (Almost) all Trees (ii)," Theoretical Computer Science, vol. 221, pp. 77118, 1999.
[16] O. Eulenstein, D. Chen, J.G. Burleigh, D. FernándezBaca, and M.J. Sanderson, "Performance of Flip Supertrees with a Heuristic Algorithm," Systematic Biology, vol. 53, no. 2, pp. 299308, 2004.
[17] M.R. Garey and D.S. Johnson, Computers and Intractability; A Guide to the Theory of NPCompleteness. W.H. Freeman and Company, 1979.
[18] M.X. Goemans and D.P. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," J. Assoc. for Computing Machinery, vol. 42, no. 6, pp. 11151145, Nov. 1995.
[19] I. Gronau, S. Moran, and S. Snir, "Fast and Reliable Reconstruction of Phylogenetic Trees with Very Short Branches," Proc. ACMSIAM Symp. Discrete Algorithms (SODA), pp. 379388, 2008.
[20] D. Huson, S. Nettles, and T. Warnow, "DiskCovering, a Fast Converging Method for Phylogenetic Tree Reconstruction," J. Computational Biology, vol. 6, pp. 369386, 1999.
[21] E. Mossel, "Distorted Metrics on Trees and Phylogenetic Forests," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 4, no. 1, pp. 108116, Jan.Mar. 2007.
[22] M. Wojciechowski, M. Sanderson, K. Steele, and A. Liston, "Molecular Phylogeny of the 'Temperate Herbaceous Tribes' of Papilionoid Legumes: A Supertree Approach," Advances in Legume Systematics, Part 9, P. Herendeen and A. Bruneau, eds., vol. 9, pp. 277298, Royal Botanic Gardens, 2000.
[23] S. Price, O. Bininda Emonds, and J. Gittleman, "A Complete Phylogeny of the Whales, Dolphins and EvenToed Hoofed Mammals (Cetartiodactyla)," Biological Rev., vol. 80, no. 3, pp. 445473, 2005.
[24] M.A. Ragan, "Matrix Representation in Reconstructing PhylogeneticRelationships among the Eukaryotes," Biosystems, vol. 28, pp. 4755, 1992.
[25] B. Rannala, J.P. Huelsenbeck, Z. Yang, and R. Nielsen, "Taxon Sampling and the Accuracy of Large Phylogenies," Systematic Biology, vol. 47, pp. 702710, 1998.
[26] V. Ranwez and O. Gascuel, "QuartetBased Phylogenetic Inference: Improvements and Limits," Molecular Biology and Evolution, vol. 18, pp. 11031116, 2001.
[27] K. Rice, M. Donoghue, and R. Olmstead, "Analyzing Large Datasets: rbcL 500 Revisited," Systematic Biology, vol. 46, no. 3, pp. 554563, 1997.
[28] U. Roshan, B.M.E. Moret, T.L. Williams, and T. Warnow, "Recidcm3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Tree," Proc. IEEE Computational Systems Bioinformatics Conf. (CSB), 2004.
[29] S. Snir and S. Rao, "Using Max Cut to Enhance Rooted Trees Consistency," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 4, pp. 323333, Oct.Dec. 2006, preliminary version appeared in Proc. WABI, 2005.
[30] S. Snir, T. Warnow, and S. Rao, "Short Quartet Puzzling: A New QuartetBased Phylogeny Reconstruction Algorithm," J. Computational Biology, vol. 1, no. 15, pp. 91103, 2008.
[31] M. Steel, "The Complexity of Reconstructing Trees from Qualitative Characters and Subtress," J. Classification, vol. 9, no. 1, pp. 91116, 1992.
[32] K. Strimmer, N. Goldman, and A. von Haeseler, "Bayesian Probabilities and Quartet Puzzling," Molecular Biology and Evolution, vol. 14, pp. 210211, 1997.
[33] K. Strimmer and A. von Haeseler, "Quartet Puzzling: A Quartet MaximumLikelihood Method for Reconstructing Tree Topologies," Molecular Biology and Evolution, vol. 13, no. 7, pp. 964969, 1996, ftp://ftp.ebi.ac.uk/pub/software/unixpuzzle /.
[34] S. Willson, "Building Phylogenetic Trees from Quartets by Using Local Inconsistency Measures," Molecular Biology and Evolution, vol. 16, pp. 685693, 1998.