Constructing big trees from short sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 827-837

  Erdős, Péter L ^a   Steel, Michael A ^b   Székely, László A ^c   Warnow, Tandy J ^d  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY; POLYNOMIAL APPROXIMATION; ROBOTS; TOPOLOGY; TREES (MATHEMATICS);

BIG TREES; CORRECT TOPOLOGY; EVOLUTIONARY TREE; NEIGHBOR JOINING; POLYNOMIAL TIME METHODS; POLYNOMIAL-TIME ALGORITHMS; SHORT SEQUENCES; STATISTICAL POWER;

EVOLUTIONARY ALGORITHMS;

EID: 84951102016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_235     Document Type: Conference Paper

References (15)

1. R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, and M. Thorup. On the approximability of numerical taxonomy: fitting distanaces by tree metrics. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996.
2. D. J. Aldous, Probability distributions on eladograms, in: Discrete Random Structures, eds. D. J. Aldous and R. Permantle, Springer-Verlag, IMA Vol. in Mathematics and its Applications. Vol. 76, 1-18, 1995.
3. J.K.M. Brown, Probabilities of evolutionary trees, Syst. Biol. 43(1), 7-91, (1994).
4. P. Buneman, The recovery of trees from measures of dissimilarity, in Mathematics in the Archaeological and Historical Sciences, F. R. Hodson, D. G. Kendall, P. Tautu, eds.; Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
5. J. Cohen and M. Farach, Numerical Taxonomy on Data: Experimental Results. SODA '97 and RECOMB '97.
6. M. Farach, and S. Kannan, Efficiem algorithms for inverting evolution, Proceedings of the ACM Symposium on the Foundations of Computer Science, 230-236, (1996).
7. J. Felsenstein, Cases in which parsimony or compatibility methods will be positively misleading, Syst. Zool., 27, 401-410 (1978).
8. J. Felsenstein, Numerical methods for inferring evolutionary trees, Quarterly Review of Biology, 57 (1982), pp. 379-404.
9. W. Fitch, A non-sequential method for constructing trees and hierarchical classifications. J. Mol. Evol., (18):30-37, 1981.
10. E. F. Harding, The probabilities of rooted tree shapes generated by random bifurcation, Adv. Appl. Probab. 3, 44-77, (1971).
11. D. Hillis, Approaches for assessing phylogenetic accuracy. Syst. Biol. 44(1):3-16, 1995.
12. D. Hillis, J. Huelsenbeck, and D. Swofford, Hobgoblin of phylogenetics? Nature, Vol. 369, 1994, pp. 363-364.
13. J. Neyman, Molecular studies of evolution: a source of novel statistical problems. Pages 1-27 of Gupta, S.S. and J. Yackel (eds), Statistical Decision Theory and Related Topics. New York: Academic Press, 1971.
14. D. Penny, M. Hendy, and M. Steel, Progress with methods for constructing evolutionary trees. Trends Ecol. Evol. (7): 73-79, 1992.
15. M. A. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification, 9, 91-116 (1992).