Distorted metrics on trees and phylogenetic forests

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 4, Issue 1, 2007, Pages 108-116

  Mossel, Elchanan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

CFN; Distortion; Forest; Jukes Cantor; Metric; Phylogenetics; Tree

Indexed keywords

JUKES-CANTOR; PHYLOGENETIC FORESTS; POLYNOMIAL TIME;

ALGORITHMS; BIOINFORMATICS; GENE EXPRESSION; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION;

BINARY TREES;

ALGORITHM; ANIMAL; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; GENETICS; GENOME; HUMAN; METHODOLOGY; MUTATION; PHYLOGENY;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; GENOME; HUMANS; MODELS, GENETIC; MUTATION; PHYLOGENY;

EID: 33847726622     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2007.1010     Document Type: Conference Paper

References (26)

1. D. Barry and J.A. Hartigan, "Asynchronous Distance between Homologous DNA Sequences," Biometrics, vol. 43, pp. 261-267, 1987.
2. O.R.P. Bininda-Emonds, S.G. Brady, J. Kim, and M.J. Sanderson, "Scaling of Accuracy in Extremely Large Phylogenetic Trees," Proc. Sixth Pacific Symp. Biocomputing (PSB '01), pp. 547-558, 2001.
3. P. Buneman, "The Recovery of Trees from Measures of Dissimilarity," Math. in the Archaelogical and Historical Sciences, pp. 187-395, Edinburgh Univ. Press, 1971.
4. J.A. Cavender, "Taxonomy with Confidence," Math. Bioscience, vol. 40, nos. 3-4, 1978.
5. B. Chor and T. Tuller, "Maximum Likelihood of Evolutionary Trees Is Hard," Proc. Ninth Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB), p. 296, 2005.
6. M. Cryan, L.A. Goldberg, and P. W. Goldberg, "Evolutionary Trees Can Be Learned in Polynomial Time," SIAM J. Computing, vol. 31, no. 2, pp. 375-397, 2002.
7. C. Daskalakis, C. Hill, A. Jaffe, R. Mihaescu, E. Mossel, and S. Rao, "Maximal Accurate Forests from Distance Matrices," Proc. 10th Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '06), 2006.
8. C. Daskalakis, E. Mossel, and S. Roch, "Optimal Phylogenetic Reconstruction," preprint, available on the Arxiv at math.PR/ 0509575, 2005.
9. W. Day, D. Johnson, and D. Sankoff, "The Computational Complexity of Inferring Rooted Phytogenies by Parsimony," Math. Biosciences, vol. 86, pp. 33-42, 1986.
10. P.L. Erdös, M.A. Steel, L.A. Székely, and T.A. Warnow, "A Few Logs Suffice to Build (Almost) All Trees (Part 1)," Random Structures Algorithms, vol. 14, no. 2, pp. 153-184, 1999.
11. P.L. Erdös, M.A. Steel, L.A. Székely, and T.A. Warnow, "A Few Logs Suffice to Build (Almost) All Trees (Part 2)," Theoretical Computer Science, vol. 221, pp. 77-118, 1999.
12. J. Felsenstein, "Cases in Which Parsimony or Compatibility Methods Will Be Positively Misleading," Systems Biology, pp. 401-410, 1978.
13. J. Felsenstein, Inferring Phylogenies. Sinauer, 2004.
14. L.R. Foulds and R.L. Graham, "The Steiner Problem in Phylogeny Is NP-Complete," Advances in Applied Math., vol. 3, pp. 43-49, 1982.
15. R.L. Graham and L.R. Foulds, "Unlikelihood that Minimal Phylogenies for a Realistic Biological Study Can Be Constructed in Reasonable Computational Time," Math. Bioscience, vol. 60, pp. 133-142, 1982.
16. D. Gusfield, "Efficient Algorithms for Inferring Evolutionary Trees," Networks, vol. 21, 1991.
17. J. Kim, "Large Scale Phylogenies and Measuring the Performance of Phylogenetic Estimators," Systems Biology, vol. 47, pp. 43-60, 1998.
18. E. Mossel, "On the Impossibility of Reconstructing Ancestral Data and Phylogenies," J. Computational Biology, vol. 10, no. 5, pp. 669678, 2003.
19. E. Mossel, "Phase Transitions in Phytogeny," Trans. Am. Math. Soc., vol. 356, no. 6, pp. 2379-2404, 2004.
20. E. Mossel and S. Roch, "Learning Nonsingular Phylogenies and Hidden Markov Models," Proc. 37th Ann. ACM Symp. Theory of Computing (STOC '05), pp. 366-376. 2005.
21. E. Mossel and M. Steel, "A Phase Transition for a Random Cluster Model on Phylogenetic Trees," Math. Bioscience, vol. 187, no. 2, pp. 189-203, 2004.
22. S. Roch, "A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 1, pp. 92-94, Jan.-Mar. 2006.
23. C. Semple and M. Steel, Phylogenetics. Oxford Univ. Press, 2003.
24. E. Sober and M.A. Steel, "Testing the Hypothesis of Common Ancestry," J. Theoretical Biology, vol. 218, pp. 395-408, 2002.
25. M. Steel, "Recovering a Tree from the Leaf Colourations It Generates under a Markov Model," Applied Math. Letters, vol. 7, no. 2, pp. 19-23, 1994.
26. M.A. Steel and L.A. Székely, "Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications," SIAM J. Discrete Math., vol. 15, no. 4, pp. 562-575, 2002.