Advertisement

Bulletin of Mathematical Biology

, Volume 80, Issue 6, pp 1563–1577 | Cite as

Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics

Original Article
  • 57 Downloads

Abstract

Böcker and Dress (Adv Math 138:105–125, 1998) presented a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree T with leaf set X and a proper vertex coloring of its interior vertices, we can map every triple of three different leaves to the color of its median vertex. We characterize all ternary maps that can be obtained in this way in terms of 4- and 5-point conditions, and we show that the corresponding tree and its coloring can be reconstructed from a ternary map that satisfies those conditions. Further, we give an additional condition that characterizes whether the tree is binary, and we describe an algorithm that reconstructs general trees in a bottom-up fashion.

Keywords

Symbolic ternary metric Median vertex Unrooted phylogenetic tree 

Notes

Acknowledgements

We thank the anonymous referees for their helpful comments and suggestions. We thank Peter F. Stadler for suggesting to consider general median graphs and Zeying Xu for some useful comments. This work is supported by the NSFC (11671258) and STCSM (17690740800). YL acknowledges support of Postdoctoral Science Foundation of China (No. 2016M601576).

References

  1. Bandelt H-J, Steel MA (1995) Symmetric matrices representable by weighted trees over a cancellative abelian monoid. SIAM J Discret Math 8(4):517–525MathSciNetCrossRefMATHGoogle Scholar
  2. Böcker S, Dress AWM (1998) Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv Math 138(1):105–125MathSciNetCrossRefMATHGoogle Scholar
  3. Colonius H, Schulze HH (1981) Tree structures for proximity data. Br J Math Stat Psychol 34(2):167–180MathSciNetCrossRefMATHGoogle Scholar
  4. Dress A, Huber TK (2012) Basic phylogenetic combinatorics. Cambridge University Press, CambridgeMATHGoogle Scholar
  5. Gurvich V (1984) Decomposing complete edge-chromatic graphs and hypergraphs. Doklady Akad. Nauk SSSR 279(6):1306–1310 (in Russian)MathSciNetGoogle Scholar
  6. Gurvich V (1984) Some properties and applications of complete edge-chromatic graphs and hypergraphs. Soviet Math. Dokl 30:803–807MATHGoogle Scholar
  7. Gurvich V (2009) Decomposing complete edge-chromatic graphs and hypergraphs. Revisited. Discret Appl Math 157(14):3069–3085MathSciNetCrossRefMATHGoogle Scholar
  8. Hellmuth M, Hernandez-Rosales M, Huber KT, Moulton V, Stadler PF, Wieseke N (2013) Orthology relations, symbolic ultrametrics, and cographs. J Math Biol 66(1–2):399–420MathSciNetCrossRefMATHGoogle Scholar
  9. Hellmuth M, Wieseke N, Lechner M, Lenhof H-P, Middendorf M, Stadler PF (2015) Phylogenetics from paralogs. Proc. Natl. Acad. Sci. USA 112:2058–2063.  https://doi.org/10.1073/pnas.1412770112 CrossRefGoogle Scholar
  10. Huber KT, Moulton V, Scholz GE (2017) Three-way symbolic tree-maps and ultrametrics. arXiv preprint arXiv:1707.08010
  11. Semple C, Steel MA (2003) Phylogenetics, vol 24. Oxford University Press on Demand, OxfordMATHGoogle Scholar
  12. Simonyi G (2001) Perfect graphs and graph entropy. An updated survey, Chapter 13. In: Ramirez-Alfonsin J, Reed B (eds) Perfect graphs. John Wiley and Sons, pp 293–328Google Scholar
  13. Weyer Menkhoff J (2003) New quartet methods in phylogenetic combinatorics. PhD thesis, Universität BielefeldGoogle Scholar

Copyright information

© Society for Mathematical Biology 2018

Authors and Affiliations

  1. 1.CAS-MPG Partner Institute for Computational BiologyChinese Academy of Sciences Key Laboratory of Computational BiologyShanghaiChina
  2. 2.School of Mathematics and StatisticsCentral China Normal UniversityWuhanChina
  3. 3.Department of Mathematics and MOE-LSCShanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations