
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yu Lin, V. Rajan, B. M. E. Moret, "A Metric for Phylogenetic Trees Based on Matching," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 4, pp. 10141022, JulyAug., 2012.  
BibTex  x  
@article{ 10.1109/TCBB.2011.157, author = { Yu Lin and V. Rajan and B. M. E. Moret}, title = {A Metric for Phylogenetic Trees Based on Matching}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {9}, number = {4}, issn = {15455963}, year = {2012}, pages = {10141022}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.157}, 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  A Metric for Phylogenetic Trees Based on Matching IS  4 SN  15455963 SP1014 EP1022 EPD  10141022 A1  Yu Lin, A1  V. Rajan, A1  B. M. E. Moret, PY  2012 KW  genetics KW  bioinformatics KW  botany KW  evolution (biological) KW  RobinsonFoulds distance KW  phylogenetic trees KW  computational biology KW  pairwise measurement KW  RobinsonFoulds distance KW  pairwise distance measurement KW  statistical testing KW  hierarchical clustering KW  Phylogeny KW  Computational biology KW  Robustness KW  Bioinformatics KW  Time measurement KW  Polynomials KW  TBR. KW  Phylogenetic trees KW  matching distance KW  RobinsonFoulds distance KW  NNI KW  SPR VL  9 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] B.L. Allen and M. Steel, "Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees," Annals of Combinatorics, vol. 5, no. 1, pp. 115, 2001.
[2] A. Amir and D. Keselman, "Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms," SIAM J. Computing, vol. 26, no. 6, pp. 16561669, 1997.
[3] D. Bogdanowicz and K. Giaro, "Matching Split Distance for Unrooted Binary Phylogenetic Trees," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 9, no. 1, pp. 150160, Jan./Feb. 2012.
[4] D. Bryant, "Hunting for Trees, Building Trees and Comparing Trees: Theory and Method in Phylogenetic Analysis," PhD thesis, Univ. of Canterbury, 1997.
[5] D. Bryant and M. Steel, "Computing the Distribution of a Tree Metric," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 6, no. 3, pp. 420426, JulySept. 2009.
[6] R. Cole, M. FarachColton, R. Hariharan, T. Przytycka, and M. Thorup, "An O$(n log n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees," SIAM J. Computing, vol. 30, no. 5, pp. 13851404, 2000.
[7] B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, "On Distances between Phylogenetic Trees," Proc. Eighth ACM/SIAM Symp. Discrete Algorithms (SODA '97), pp. 427436, 1997.
[8] W.H.E. Day, "Optimal Algorithms for Comparing Trees with Labeled Leaves," J. Classification, vol. 2, no. 1, pp. 728, 1985.
[9] J. Edmonds and R.M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems," J. ACM, vol. 19, no. 2, pp. 248264, 1972.
[10] M. Farach, T.M. Przytycka, and M. Thorup, "On the Agreement of Many Trees," Information Processing Letters, vol. 55, no. 6, pp. 297301, 1995.
[11] H.N. Gabow and R.E. Tarjan, "Faster Scaling Algorithms for Network Problems," SIAM J. Computing, vol. 18, no. 5, pp. 10131036, 1989.
[12] G. Hickey, F. Dehne, A. RauChaplin, and C. Blouin, "SPR Distance Computation of Unrooted Trees," Evolutionary Bioinformatics Online, vol. 4, pp. 1727, 2008.
[13] M.Y. Kao, "Tree Contractions and Evolutionary Trees," SIAM J. Computing, vol. 27, no. 6, pp. 15921616, 1998.
[14] M. Li, J. Tromp, and L. Zhang, "On the NearestNeighbour Interchange Distance between Evolutionary Trees," J. Theoretical Biology, vol. 182, no. 4, pp. 463467, 1996.
[15] M. Meila, "Comparing Clusteringsan Information Based Distance," J. Multivariate Analysis, vol. 98, no. 5, pp. 873895, 2007.
[16] N.D. Pattengale, E.J. Gottlieb, and B.M.E. Moret, "Efficiently Computing the RobinsonFoulds Metric," J. Computational Biology, vol. 14, no. 6, pp. 724735, 2007.
[17] N.D. Pattengale, K.M. Swenson, and B.M.E. Moret, "Uncovering Hidden Phylogenetic Consensus," Proc. Sixth Int'l Symp. Bioinformatics Research and Applications, (ISBRA '10), pp. 128139, 2010.
[18] D.R. Robinson and L.R. Foulds, "Comparison of Phylogenetic Trees," Math. Biosciences, vol. 53, pp. 131147, 1981.
[19] M. Steel and D. Penny, "Distributions of Tree Comparison Metrics—Some New Results," Systematic Biology, vol. 42, no. 2, pp. 126141, 1993.
[20] M. Steel and T. Warnow, "Kaikoura Tree Theorems: Computing Maximum Agreement Subtree Problem," Information Processing Letters, vol. 48, pp. 7782, 1993.
[21] C. Stockham, L.S. Wang, and T. Warnow, "StatisticallyBased Postprocessing of Phylogenetic Analysis Using Clustering," Proc. 10th Conf. Intelligent Systems for Molecular Biology (ISMB '02), pp. S285S293, 2002.
[22] C. Whidden and N. Zeh, "A Unifying View on Approximation and Fpt of Agreement Forests," Proc. Sixth Workshop Algorithms in Bioinformatics (WABI '06), pp. 390402, 2006.