The ordinal quartet method

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	N. Alon, J. Spencer, and P. ErdSs. The Probabilistic Method. John Wiley ~ Sons, 1992.
	3	Kevin Atteson, The Performance of Neighbor-Joining Algorithms of Phylogeny Recronstruction, Proceedings of the Third Annual International Conference on Computing and Combinatorics, p.101-110, August 20-22, 1997
	4	Hans-Jürgen Bandelt , Andreas Dress, Reconstructing the shape of a trea from observed dissimilarity data, Advances in Applied Mathematics, v.7 n.3, p.309-343, Sept. 1986 [doi>10.1016/0196-8858(86)90038-2]
	5	H.J. Bandelt and A. W. M. Dress. Split decomposition: A new and useful approach to phylogemedic analysis of als~-ce da~a. Molecular Phylogenetics and Evolution, 1, i992.
	6	Vincent Berry , Olivier Gascuel, Inferring Evolutionary Trees with Strong Combinatorial Evidence, Proceedings of the Third Annual International Conference on Computing and Combinatorics, p.111-123, August 20-22, 1997
	7	P. Buneman. The recovery of trees from measures of dis 'szmila.qty. In Hodson, Kendall, and Tautu, editors, Mathematics in the Archaeological and Historical Sciences. Edinburgh University Press, Edinburgh, 1971.
	8	H. Colonius and H. $chulze. Tree s~ruc~ures for proximity data. British Journal of Mathematical and Statistical Psychology, 34:167'-180, 1981.
	9	P. ErdSs, K. PAce, M. Steel, L. Sz~kely, and T. Warnow. The shor~ qua~e~ method, to appear, 1997.
	10	Peter Erdös , Mike Steel , László A. Székely , Tandy Warnow, Constructing Big Trees from Short Sequences, Proceedings of the 24th International Colloquium on Automata, Languages and Programming, p.827-837, July 07-11, 1997
	11	Martin Farach , Sampath Kannan, Efficient algorithms for inverting evolution, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.230-236, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.237868]
	12	J. Felsens~. Evolutionary trees from DNA sequences: A maxim-m likelihood approach. Journal of Molecular Evolution, 17:368-376, 1981.
	13	W. M. Fitch and E. MargoHash. Construction of phylogenefic ta-ees. Science., 155:279-284, 1967.
	14	A. Gu(moche. Proper~es of' an order distance associated with a tree distance. In E. I)iday e~ al., editor, Proceedings of Ordinal and Symbolic Data Analysis, pages 252-261. Spx:mger ~erlag, 1996.
	15	D. ram% j. Huelsenbeck, and D. Swofford. Hobgoblin of phylogenetics? Nature, 369:363-364, 1994.
	16	J. Huelsenbec~ Performance of phylogenetic methods in shnuhfion. Systematic Biology, 44(x):iT-qs, i99~.
	17	J. Huelse. abeck. Is the Felsensteln zone a fly trap? Systematic Biology, 46(1):69-74, 1997.
	18	J. Huelsenbeck and D. F_filis. Success ofphylogenet/c mehtods in the four-~axon case. Systematic Biology, 42(3):247-264, 1993.
	19	Sampath K. Kannan , Tandy J. Warnow, Tree Reconstruction from Partial Orders, SIAM Journal on Computing, v.24 n.3, p.511-519, June 1995 [doi>10.1137/S0097539793252195]
	20	P. E. I(em-ney. A six-po'mi condition for ordinal matrices. Journal of Computational Biology, 4(2):143--156, 1997.
	21	Paul E. Kearney , Ryan B. Hayward , Henk Meijer, Inferring evolutionary trees from ordinal data, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.418-426, January 05-07, 1997, New Orleans, Louisiana, United States
	22	N. Saitou and M. Nei. The neigl~or,--jo~mTmg method: A new method for recons~-uc6ng phylogenelfic trees. Molecular Biology and E~olution, 4:406-425, 1987.
	23	I:L I:L Sold and P. H. A. Sheath. Principles of Numerical Taxonomy. W. H. Freeman, San Francisco, 1963.
	24	K. $~ex and A. yon Haeseler. Quartet puzzling: A qua_~et maxlmum-~ood method for reconstructing tree topologies. Molecular Biology and Evolution, 13(7):964-969, 1996.
	25	D. L. Swofford, G. J. Olsen, P. J. Waddell, and D. M tFfllis. Phylogenet;ic inference. In D. M. l~}~.q, C. Moritz, and B. K. Mable, editors, Molecular $ystematics, ~nd Edition. Sinauer Associates, Sunderland, Massachusetts, 1996.
	26	Li Wen-H~ung. Molecular Evolution. Sinauex Associates, Inc., Sunderland Massachusetts, 1997.