Abstract
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for tree/network construction, it becomes important to measure how well the constructed networks capture the given character relationship across the species.
In the current study, we propose a novel method for measuring the specificity of a given phylogenetic network in terms of the total number of distributions of character states at the leaves that the network may impose. While for binary phylogenetic trees, this number has an exact formula and depends only on the number of leaves and character states but not on the tree topology, the situation is much more complicated for non-binary trees or networks. Nevertheless, we develop an algorithm for combinatorial enumeration of such distributions, which is applicable for arbitrary trees and networks under some reasonable assumptions.
The work is supported by the National Science Foundation under the grant No. IIS-1462107.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
An implementation of the present algorithm in the SageMath mathematical software is available at http://cblab.org/projects/.
References
Holland, B.R., Huber, K.T., Moulton, V., Lockhart, P.J.: Using consensus networks to visualize contradictory evidence for species phylogeny. Mol. Biol. Evol. 21(7), 1459–1461 (2004)
Huson, D.H., Scornavacca, C.: A survey of combinatorial methods for phylogenetic networks. Genome Biol. Evol. 3, 23–35 (2011)
Ulyantsev, V., Melnik, M.: Constructing parsimonious hybridization networks from multiple phylogenetic trees using a SAT-solver. In: Dediu, A.-H., Hernández-Quiroz, F., MartÃn-Vide, C., Rosenblueth, D.A. (eds.) AlCoB 2015. LNCS, vol. 9199, pp. 141–153. Springer, Heidelberg (2015)
Wu, Y.: An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees. J. Comput. Biol. 20(10), 792–804 (2013)
Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. J. Classif. 9(1), 91–116 (1992)
Kelk, S.: A note on convex characters and Fibonacci numbers (2015). arXiv eprint: arXiv:1508.02598
Korneyenko, N.: Combinatorial algorithms on a class of graphs. Discret. Appl. Math. 54(23), 215–217 (1994)
Brandes, U., Cornelsen, S.: Phylogenetic graph models beyond trees. Discret. Appl. Math. 157(10), 2361–2369 (2009)
Huson, D.H., Rupp, R., Berry, V., Gambette, P., Paul, C.: Computing galled networks from real data. Bioinformatics 25(12), i85–i93 (2009)
Semple, C., Steel, M.: Tree reconstruction from multi-state characters. Adv. Appl. Math. 28(2), 169–184 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Alexeev, N., Alekseyev, M.A. (2016). Combinatorial Scoring of Phylogenetic Networks. In: Dinh, T., Thai, M. (eds) Computing and Combinatorics . COCOON 2016. Lecture Notes in Computer Science(), vol 9797. Springer, Cham. https://doi.org/10.1007/978-3-319-42634-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-42634-1_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42633-4
Online ISBN: 978-3-319-42634-1
eBook Packages: Computer ScienceComputer Science (R0)