{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:10:40Z","timestamp":1773277840366,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319212326","type":"print"},{"value":"9783319212333","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21233-3_11","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T16:30:47Z","timestamp":1438014647000},"page":"141-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Ulyantsev","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Melnik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0065-2458(03)58003-2","volume":"58","author":"A Biere","year":"2003","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Adv. Comput. 58, 117\u2013148 (2003)","journal-title":"Adv. Comput."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-02777-2_3","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"ML Bonet","year":"2009","unstructured":"Bonet, M.L., John, K.S.: Efficiently calculating evolutionary tree measures using SAT. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 4\u201317. Springer, Heidelberg (2009)"},{"issue":"8","key":"11_CR3","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1016\/j.dam.2006.08.008","volume":"155","author":"M Bordewich","year":"2007","unstructured":"Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discret. Appl. Math. 155(8), 914\u2013928 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"22","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1093\/bioinformatics\/btq548","volume":"26","author":"ZZ Chen","year":"2010","unstructured":"Chen, Z.Z., Wang, L.: Hybridnet: a tool for constructing hybridization networks. Bioinform. 26(22), 2912\u20132913 (2010)","journal-title":"Bioinform."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-15488-1_7","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"MJH Heule","year":"2010","unstructured":"Heule, M.J.H., Verwer, S.: Exact DFA identification using SAT solvers. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS, vol. 6339, pp. 66\u201379. Springer, Heidelberg (2010)"},{"key":"11_CR6","unstructured":"H\u00f6lldobler, S., Nguyen, V.: An efficient encoding of the at-most-one constraint. Technical report, KRR Group 2013\u201304, Technische Universit\u00e4t Dresden, 01062 Dresden, Germany (2013)"},{"key":"11_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511974076","volume-title":"Phylogenetic Networks: Concepts, Algorithms and Applications","author":"DH Huson","year":"2010","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, New York (2010)"},{"key":"11_CR8","volume-title":"Introduction to Phylogenetic Networks","author":"DA Morrison","year":"2011","unstructured":"Morrison, D.A.: Introduction to Phylogenetic Networks. RJR Productions, Uppsala (2011)"},{"key":"11_CR9","first-page":"125","volume-title":"Problem Solving Handbook in Computational Biology and Bioinformatics","author":"L Nakhleh","year":"2011","unstructured":"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\u2013158. Springer, Berlin (2011)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11533719_11","volume-title":"Computing and Combinatorics","author":"L Nakhleh","year":"2005","unstructured":"Nakhleh, L., Ruths, D., Wang, L.-S.: RIATA-HGT: a fast and accurate heuristic for reconstructing horizontal gene transfer. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 84\u201393. Springer, Heidelberg (2005)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-30191-9_20","volume-title":"Bioinformatics Research and Applications","author":"HJ Park","year":"2012","unstructured":"Park, H.J., Nakhleh, L.: MURPAR: a fast heuristic for inferring parsimonious phylogenetic networks from multiple gene trees. In: Bleris, L., M\u0103ndoiu, I., Schwartz, R., Wang, J. (eds.) ISBRA 2012. LNCS, vol. 7292, pp. 213\u2013224. Springer, Heidelberg (2012)"},{"key":"11_CR12","volume-title":"Hybridization Networks","author":"C Semple","year":"2006","unstructured":"Semple, C.: Hybridization Networks. Department of Mathematics and Statistics, University of Canterbury, New York (2006)"},{"issue":"12","key":"11_CR13","doi-asserted-by":"publisher","first-page":"i140","DOI":"10.1093\/bioinformatics\/btq198","volume":"26","author":"Y Wu","year":"2010","unstructured":"Wu, Y.: Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees. Bioinformat. 26(12), i140\u2013i148 (2010)","journal-title":"Bioinformat."},{"issue":"10","key":"11_CR14","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1089\/cmb.2013.0072","volume":"20","author":"Y Wu","year":"2013","unstructured":"Wu, Y.: An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees. J. Comput. Biol. 20(10), 792\u2013804 (2013)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21233-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:40:57Z","timestamp":1676972457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21233-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319212326","9783319212333"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21233-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}