Teasing apart two trees

Combinatorics Probability and Computing

Volumn 16, Issue 6, 2007, Pages 903-922

  Steel, M A ^a   Szekely L A ^b  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

NEAR-TIGHT RAMSEY-TYPE RESULTS; TRUE TREES (MATHEMATICS);

TREES (MATHEMATICS);

EID: 35348950485     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008656     Document Type: Article

References (22)

1. Alon, N., and Spencer, J. H. (1992) The Probabilistic Method, Wiley, New York.
2. Bininda-Emonds, O. R. P., Brady, S. G., Kim, J. and Sanderson, M. J. (2001) Scaling of accuracy in extremely large phylogenetic trees. Pacific Symposium on Biocomputing 6 547-558.
3. Colonius, H. and Schulze, H. H. (1981) Tree structures for proximity data. British J. Math. Statist. Psych. 34 167-180.
4. Daskalakis, C., Mossel, E. and Roch, S. (2006) Optimal phylogenetic reconstruction. Proc 38th annual ACM Symposium on Theory of Computing (STOC) 159-68. ACM Press, New York.
5. Dekker, M. C. H. (1986) Reconstruction methods for derivation trees. Master's thesis, Vrije Universiteit, Amsterdam.
6. Erdos, P. L., Steel, M. A., Székely, L. A. and Warnow, T. J. (1999) A few logs suffice to build (almost) all trees I. Random Struct. Alg. 14 153-184.
7. Evans, W., Kenyon, C., Peres, Y. and Schulman, L. J. (2000) Broadcasting on trees and the Ising model. Adv. Appl. Probab. 10 410-433.
8. Guindon, S. and Gascuel, O. (2003) A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Systematic Biology 52 696-704.
9. Lovász, L. (1979) Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest, and North-Holland.
10. Mason, K. (1996) On a matter of uncertain parentage. Honours III project, University of Canterbury.
11. Mossel, E. (1998) Recursive reconstruction on periodic trees. Random Struct. Alg. 13 81-97.
12. Mossel, E. (2004) Phase transitions in phylogeny Trans. Amer. Math. Soc. 356 2379-2404.
13. Mossel, E. and Peres, Y. (2003) Information flow on trees. Ann. Appl. Probab. 13 817-844.
14. Neyman, J. (1971) Molecular studies of evolution: A source of novel statistical problems. In Statistical Decision Theory and Related Topics (S. S. Gupta and J. Yackel, eds), New York, Academic Press, pp. 1-27.
15. Rokas, A. and Carroll, S. B. (2005) More genes or more taxa? The relative contribution of gene number and taxon number to phylogenetic accuracy. Mol. Biol. Evol. 22 1337-1344.
16. Semple, C. and Steel, M. (2003) Phylogenetics, Oxford University Press.
17. Stamatakis, A. P., Ludwig, T. and Meier, H. (2004). A fast program for maximum likelihoodbased inference of large phylogenetic tress. In Proc. 2004 ACM Symposium on Applied Computing, ACM Press, New York, pp. 197-201.
18. Steel, M. (1989) Distributions on bicoloured evolutionary trees. PhD thesis, Massey University, Palmerston North, New Zealand.
19. Steel, M. and Charleston, M. (1995) Five surprising properties of parsimoniously coloured trees. Bull. Math. Biol. 57 367-375.
20. Steel, M. A., Hendy, M. D. and Penny, D. (1998) Reconstructing phylogenies from nucleotide pattern frequencies : A survey and some new results. Discrete Appl. Math. 88 367-396.
21. Steel, M. A. and Székely, L. A. (1999) Inverting random functions. Ann. Combin. 3 103-113.
22. Steel, M. A. and Székely, L. A. (2002) Inverting random functions II: Explicit bounds for the discrete maximum likelihood estimation, with applications. SIAM J. Discrete Math. 15 562-575.