Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver
We present an exact algorithm for constructing minimal hybridization networks from multiple trees which is based on reducing the problem to the Boolean satisfiability problem. The main idea of our algorithm is to iterate over possible hybridization numbers and to construct a Boolean formula for each of them that is satisfiable iff there exists a network with such hybridization number. The proposed algorithm is implemented in a software tool PhyloSAT. The experimental evaluation of our algorithm on biological data shows that our method is as far as we know the fastest exact algorithm for the minimal hybridization network construction problem.
KeywordsPhylogenetic networks Boolean satisfiability SAT Bioinformatics Genetics
This work was financially supported by the Government of Russian Federation, Grant 074-U01. Authors would like to thank Igor Buzhinsky, Daniil Chivilikhin and Fedor Tsarev for helpful comments and conversations.
- 6.Hölldobler, S., Nguyen, V.: An efficient encoding of the at-most-one constraint. Technical report, KRR Group 2013–04, Technische Universität Dresden, 01062 Dresden, Germany (2013)Google Scholar
- 8.Morrison, D.A.: Introduction to Phylogenetic Networks. RJR Productions, Uppsala (2011)Google Scholar
- 9.Nakhleh, L.: Evolutionary phylogenetic networks: models and issues. In: Heath, L.S., Ramakrishnan, H. (eds.) Problem Solving Handbook in Computational Biology and Bioinformatics, pp. 125–158. Springer, Berlin (2011)Google Scholar
- 12.Semple, C.: Hybridization Networks. Department of Mathematics and Statistics, University of Canterbury, New York (2006) Google Scholar