Abstract
Phylogenetic networks are a type of leaf-labelled, acyclic, directed graph used by biologists to represent the evolutionary history of species whose past includes reticulation events. A phylogenetic network is tree–child if each non-leaf vertex is the parent of a tree vertex or a leaf. Up to a certain equivalence, it has been recently shown that, under two different types of weightings, edge-weighted tree–child networks are determined by their collection of distances between each pair of taxa. However, the size of these collections can be exponential in the size of the taxa set. In this paper, we show that, if we have no “shortcuts”, that is, the networks are normal, the same results are obtained with only a quadratic number of inter-taxa distances by using the shortest distance between each pair of taxa. The proofs are constructive and give cubic-time algorithms in the size of the taxa sets for building such weighted networks.
Similar content being viewed by others
References
Baroni M, Semple C, Steel M (2006) Hybrids in real time. Syst Biol 55:46–56
Bickner DR (2012) On normal networks. Ph.D. thesis, Iowa State University, Ames, Iowa
Bordewich M, Semple C (2016) Determining phylogenetic networks from inter-taxa distances. J Math Biol 73:283–303
Bordewich M, Tokac N (2016) An algorithm for reconstructing ultrametric tree–child networks from inter-taxa distances. Discrete Appl Math 213:47–59
Bordewich M, Semple C, Tokac N (2017) Constructing tree-child networks from distance matrices. Algorithmica. https://doi.org/10.1007/s00453-017-0320-6
Buneman P (1974) A note on the metric property. J Combin Theory Ser B 17:48–50
Cardona G, Rossello F, Valiente G (2009) Comparison of tree–child networks. IEEE/ACM Trans Comput Biol Bioinform 6:552–569
Chan H-W, Jansson J, Lam T-W, Yiu S-M (2006) Reconstructing an ultrametic galled phylogenetic network from distance matrix. J Bioinform Comput Biol 4:807–832
Huber KT, Scholz GE (2018) Beyond representing orthology relationships by trees. Algorithmica 80:73–103
McDiarmid C, Semple C, Welsh D (2015) Counting phylogenetic networks. Ann Comb 19:205–224
Saitou N, Nei M (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol 4:406–425
Semple C, Steel M (2003) Phylogenetics. Oxford University Press, Oxford
Simões-Pereira JMS (1969) A note on the tree realization of a distance matrix. J Combin Theory 6:303–310
Sokal RR (1958) A statistical method for evaluating systematic relationships. Univ Kans Sci Bull 38:1409–1438
Willson SJ (2007) Unique determination of some homoplasies at hybridization events. Bull Math Biol 69:1709–1725
Willson SJ (2007) Reconstruction of some hybrid phylogenetic networks with homoplasies from distances. Bull Math Biol 69:2561–2590
Willson SJ (2010) Properties of normal phylogenetic networks. Bull Math Biol 72:340–358
Willson SJ (2012) Tree-average distances on certain phylogenetic networks have their weights uniquely determined. Algorithm Mol Biol 7:13
Yu Y, Nakleh L (2015) A distance-based method for inferring phylogenetic networks in the presence of incomplete lineage sorting. In: Harrison R et al (eds) International symposium on bioinformatics research and applications (ISBRA), LNBI 9096, pp 378–389
Zaretskii KA (1965) Constructing trees from the set of distances between vertices. Uspehi Mat Nauk 20:90–92
Acknowledgements
We thank the anonymous referees for their helpful comments. Katharina Huber and Vincent Moulton also thank the Biomathematics Research Centre at the University of Canterbury for its hospitality.
Author information
Authors and Affiliations
Corresponding author
Additional information
Katharina T. Huber and Vincent Moulton were supported by the London Mathematical Society. Charles Semple was supported by the New Zealand Marsden Fund.
Rights and permissions
About this article
Cite this article
Bordewich, M., Huber, K.T., Moulton, V. et al. Recovering normal networks from shortest inter-taxa distance information. J. Math. Biol. 77, 571–594 (2018). https://doi.org/10.1007/s00285-018-1218-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00285-018-1218-x