Numerical taxonomy on data (abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Numerical taxonomy on data (abstract): experimental results

Full text

Pdf (129 KB)

Source

Annual Conference on Research in Computational Molecular Biology archive
Proceedings of the first annual international conference on Computational molecular biology table of contents

Santa Fe, New Mexico, United States

Page: 98

Year of Publication: 1997

ISBN:0-89791-882-7

Authors

Jaime Cohen	Department of Computer Science, Rutgers University, Piscataway, NJ
Martin Farach	Department of Computer Science, Rutgers University, Piscataway, NJ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
DOE : Department of Energy

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/267521.267535 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Richa Agarwala , Vineet Bafna , Martin Farach , Babu Narayanan , Mike Paterson , Mikkel Thorup, On the approximability of numerical taxonomy (fitting distances by tree metrics), Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.365-372, January 28-30, 1996, Atlanta, Georgia, United States
	2	J-P. Barth~lemy and A. Gu~noche. Trees and Prozimitv Representations. Wiley, New York, 1991.
	3	W.H.E. Day. Computational complexity of inferring phylogerdes from dissimilarity matrices. Bulletin of Mathernatical Biology, 49(4):461-467, 1987.
	4	M. Farach, S. Kannan, and T. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, 13:155- 179, 1993.
	5	H. T. Wareham. On the computational complexity of inletting evolutionary trees. Master's thesis, Department of Computer Science, Memorial University of Newfoundland, May 1993. Technical Report no. 9301.