Testing metric properties

Information and Computation

Volumn 187, Issue 2, 2003, Pages 155-195

  Parnas, Michal ^a   Ron, Dana ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

APPROXIMATE ULTRAMETRIC; EVOLUTIONARY BIOLOGY; TESTING METRIC PROPERTIES;

STATISTICS;

EID: 0346335711     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00160-3     Document Type: Article

References (23)

1. R. Agarwala, V. Bafna, M. Farach, M. Paterson, M. Thorup, On the approximability of numerical taxonomy (fitting distances by tree metrics), SIAM Journal on Computing 28 (3) (1999) 1073-1085.
2. N. Alon, S. Dar, M. Parnas, D. Ron, Testing of clustering, SIAM Journal on Discrete math, 16(3) (2003) 393-417.
3. J.-P. Barthélemy, A. Guénoche, Trees and Proximity Representations, Wiley, New York, 1991.
4. L.M. Blumenthal, Theory and Applications of Distance Geometry, Oxford University Press, Oxford, 1953.
5. L. Cavalli-Sforza, A. Edwards, Phylogenetic analysis models and estimation procedures, American Journal of Human Genetics 19 (1967) 233-257.
6. J. Culberson, P. Rudnicki, A fast algorithm for constructing trees from distance matrices, Information Processing Letters (1989) 215-220.
7. A. Czumaj, C. Sohler, Abstract combinatorial programs and efficient property testers, in: Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science, 2002.
8. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, Bulletin of Mathematical Biology 49 (4) (1987) 461-467.
9. A. Dress, V. von Haessler (Eds.), Trees and Hierarchical Structures, Lecture Notes in Bio-Mathematics, Springer, Berlin, 1987.
10. M. Farach, S. Kannan, T. Warnow, A robust model for finding optimal evolutionary trees, Algorithmica 13 (1/2) (1995) 155-179.
11. J. Felsenstein, Numerical methods for inferring evolutionary trees, Quarterly Review on Biology 57 (4) (1982) 379-404.
12. E. Fischer, The art of uninformed decisions: a primer to property testing, The Bulletin of the European Association for Theoretical Computer Science 75 (2001) 97-126.
13. O. Goldreich, S. Goldwasser, D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM 45 (4) (1998) 653-750.
14. O. Goldreich, D. Ron, Property testing in bounded degree graphs, Algorithmica (2002) 302-343.
15. S. Kannan, E. Lawler, T. Warnow, Determining the evolutionary tree, Journal of Algorithms 21 (1) (1996) 26-50.
16. R. Krauthgamer, O. Sasson, Property testing of data dimensionality, in: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
17. M. Kri̧ivánek, The complexity of ultrametric partitions on graphs, Information Processing Letters 27 (1988) 265-270.
18. M. Parnas, D. Ron, Testing metric properties, in: Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, 2001, pp. 276-285.
19. D. Ron, Property testing, in: S. Rajasekaran, P.M. Pardalos, J.H. Reif, J. Rolim (Eds.), Handbook of Randomized Computing, vol. II, Chapter 15, Kluwer Academic Publishers, Dordrecht, 2001, pp. 597-649.
20. R. Rubinfeld, M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal on Computing 25 (2) (1996) 252-271.
21. P.H.A. Sneath, R.R. Sokal, Numerical Taxonomy, Freeman, New York, 1973.
22. P. Turán, On an extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941) 436-452 (in Hungarian).
23. M.S. Waterman, T.F. Smith, M. Singh, W.A. Beyer, Additive evolutionary trees, Journal of Theoretical Biology 64 (1977) 199-213.