Fitting tree metrics: Hierarchical clustering and Phylogeny

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 73-82

  Ailon, Nir ^a   Charikar, Moses ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL ALGORITHM; FITTING TREE; HIERARCHICAL CLUSTERING; PHYLOGENY;

ALGORITHMS; BIT ERROR RATE; CORRELATION METHODS; GRAPH THEORY; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; STATISTICAL METHODS;

TREES (MATHEMATICS);

EID: 33748609947     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.36     Document Type: Conference Paper

References (18)

1. R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorup. On the approximabilily of numerical Laxonomy (fitting distances by tree metrics). SIAM Journal on Comparing, 28(3): 1073-1085, 1999.
2. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent, information: Ranking and clustering. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005.
3. F. Ardila. Subdominant matroid ultrametrics. Annals of Combinatorics, 8(4):379-389, 2005.
4. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning Journal (Special Issue on Theoretical Advances in Data Clustering), 56(1-3):89-113, 2004.
5. Extended abstract appeared in FOCS 2002, pages 238-247.
6. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 524-533, Boston, 2003.
7. K. Dhamdhere. Approximating additive distortion of embeddings into line metrics. In Proceedings of 7th APPROX and 8th RANDOM, volume 3122. Springer-Verlag, 2004.
8. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proceedings of the Tenth International Conference on the World Wide Web (WWW10), pages 613-622, Hong Kong, 2001.
9. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 448-455, 2005.
10. M. Farach, S. Kannan, and T. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, Special Issue on Computational Biology, pages 155-179, 1995.
11. V. Filkov and S. Skiena. Integrating microarray data by consensus clustering. In Proceedings of International Conference on Tools with Artificial Intelligence (ICTAI), pages 418-425, Sacramento, 2003.
12. A. Gionis, H. Mannila, and P. Tsaparas. Clustering aggregation. In Proceedings of the 21st International Conference on Data Engineering (ICDE), Tokyo, 2005. To appear.
13. p norms. In Proceedings of 8th APPROX and 8th RANDOM. Springer-Verlag, 2005.
14. B. Holland, K. Huber, J. Koolen, V. Moulton, and J. Weyer-Menkhoff. Delta-additive and delta-ultra-additive maps, gromov's trees, and the farris transform. Discrete Applied Mathematics, pages 51-73, 2005.
15. J. Kim and T. Warnow. Tutorial on phylogenetic tree estimation, 2004. Originally presented at ISMB 1999.
16. B. Ma, L. Wang, and L. Zhang. Fitting distances by tree metrics with increment error. Journal of Combinatorial Optimization. 3(2-3):213-225, 1999.
17. E. Mossel and S. Roch. Learning nonsingular phytogenies and hidden markov models. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005.
18. H. T. Wareham. On the complexity of inferring evolutionary trees. Technical Report Technical Report 9301, Memorial University of New Foundland, 1993.