Testing metric properties

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 276-285

  Parnas, M ^a   Ron, D ^a  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; ERROR DETECTION; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBABILITY; QUERY LANGUAGES; TREES (MATHEMATICS);

EUCLIDEAN METRICS;

STATISTICAL TESTS;

EID: 0034819398     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380811     Document Type: Conference Paper

References (23)

1. On the approximability of numerical taxonomy (fitting distances by tree metrics)
2. Testing of clustering
3. Efficient testing of large graphs
4. Regular languages are testable with a constant number of queries
5. Phylogenetic analysis models and estimation procedures
6. A fast algorithm for constructing trees from distance matrices
7. Property testing in computational geometry
8. Computational complexity of inferring phylogenies from dissimilarity matrices
9. Spot-checkers
10. A robust model for finding optimal evolutionary trees
11. Numerical methods for inferring evolutionary trees
12. Property testing and its connection to lemming and approximation
13. Property testing in bounded degree graphs
14. Determining the evolutionary tree
15. The complexity of ultrametric partitions on graphs
16. Property testing
17. Robust characterization of polynomials with applications to program testing
18. On an extremal problem in graph theory (in Hungarian)
19. Additive evolutionary trees