{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T18:38:36Z","timestamp":1792175916592,"version":"4.4.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T00:00:00Z","timestamp":1736467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T00:00:00Z","timestamp":1736467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["101034253"],"award-info":[{"award-number":["101034253"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10479-024-06452-0","type":"journal-article","created":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T04:25:12Z","timestamp":1736483112000},"page":"125-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks"],"prefix":"10.1007","volume":"345","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5002-4049","authenticated-orcid":false,"given":"Martin","family":"Frohn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9518-4724","authenticated-orcid":false,"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"key":"6452_CR1","doi-asserted-by":"crossref","unstructured":"Arnold, M.L. (1997). Natural hybridization and evolution. Oxford University Press on Demand .","DOI":"10.1093\/oso\/9780195099744.001.0001"},{"key":"6452_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1080\/10635150500431197","volume":"55","author":"M Baroni","year":"2006","unstructured":"Baroni, M., Semple, C., & Steel, M. (2006). Hybrids in real time. Systematic Biology, 55, 46\u201356.","journal-title":"Systematic Biology"},{"key":"6452_CR3","first-page":"109","volume":"1","author":"JP Bogart","year":"2003","unstructured":"Bogart, J. P. (2003). Genetics and systematics of hybrid species. Reproductive Biology and Phylogeny of Urodela, 1, 109\u2013134.","journal-title":"Reproductive Biology and Phylogeny of Urodela"},{"key":"6452_CR4","doi-asserted-by":"publisher","first-page":"103477","DOI":"10.1016\/j.jcss.2023.103477","volume":"140","author":"E Deen","year":"2023","unstructured":"Deen, E., van Iersel, L., Janssen, R., Jones, M., Murakami, Y., & Zeh, N. (2023). A near-linear kernel for bounded-state parsimony distance. Journal of Computer and System Sciences, 140, 103477.","journal-title":"Journal of Computer and System Sciences"},{"key":"6452_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0196-8858(92)90017-Q","volume":"13","author":"P Erd\u00f6s","year":"1992","unstructured":"Erd\u00f6s, P., & Sz\u00e9kely, L. (1992). Evolutionary trees: an integer multicommodity max-flow-min-cut theorem. Advances in Applied Mathematics, 13, 375\u2013389.","journal-title":"Advances in Applied Mathematics"},{"key":"6452_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/sysbio\/19.1.83","volume":"19","author":"JS Farris","year":"1970","unstructured":"Farris, J. S. (1970). Methods for computing Wagner trees. Systematic Biology, 19, 83\u201392.","journal-title":"Systematic Biology"},{"key":"6452_CR7","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1137\/140959948","volume":"29","author":"M Fischer","year":"2015","unstructured":"Fischer, M., van Iersel, L., Kelk, S., & Scornavacca, C. (2015). On computing the maximum parsimon score of a phylogenetic network. SIAM Journal on Discrete Mathematics, 29, 559\u2013585.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"6452_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/2412116","volume":"20","author":"WM Fitch","year":"1971","unstructured":"Fitch, W. M. (1971). Toward defining the course of evolution: Minimum change for a specified tree topology. Systematic Zoology, 20, 406\u2013416.","journal-title":"Systematic Zoology"},{"key":"6452_CR9","doi-asserted-by":"crossref","unstructured":"Kong, S., Pons, J. C., Kubatko, L., & Wicke, K. (2022). Classes of explicit phylogenetic networks and their biological and mathematical significance. Journal of Mathematical Biology, 84, 47.","DOI":"10.1007\/s00285-022-01746-y"},{"key":"6452_CR10","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1146\/annurev.micro.55.1.709","volume":"55","author":"EV Koonnin","year":"2001","unstructured":"Koonnin, E. V., Makarova, K. S., & Aravind, L. (2001). Horizontal gene transfer in prokaryotes: Quantification and classification. Annual Review of Microbiology, 55, 709\u2013742.","journal-title":"Annual Review of Microbiology"},{"key":"6452_CR11","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10107-022-01790-y","volume":"198","author":"N Olver","year":"2023","unstructured":"Olver, N., Schalekamp, F., van Der Ster, S., Stougie, L., & van Zuylen, A. (2023). A duality based 2-approximation algorithm for maximum agreement forest. Mathematical Programming, 198, 811\u2013853.","journal-title":"Mathematical Programming"},{"key":"6452_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2008.26","volume":"5","author":"S Sridhar","year":"2008","unstructured":"Sridhar, S., Lam, F., Blelloch, G., Ravi, R., & Schwartz, R. (2008). Mixed integer linear programming for maximum-parsimony phylogeny inference. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 5, 323\u2013331.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"6452_CR13","unstructured":"Steel, M. (2003). Phylogenetics. Oxford University Press."},{"key":"6452_CR14","doi-asserted-by":"crossref","unstructured":"Van Iersel, L., Janssen, R., Jones, M., & Murakami, Y. (2022). Orchard networks are trees with additional horizontal arcs. Bulletin of Mathematical Biology, 84, 76.","DOI":"10.1007\/s11538-022-01037-z"},{"key":"6452_CR15","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s00453-021-00914-8","volume":"84","author":"L van Iersel","year":"2022","unstructured":"van Iersel, L., Janssen, R., Jones, M., Murakami, Y., & Zeh, N. (2022). A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees. Algorithmica, 84, 917\u2013960.","journal-title":"Algorithmica"},{"key":"6452_CR16","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1093\/sysbio\/syx094","volume":"67","author":"L Van Iersel","year":"2018","unstructured":"Van Iersel, L., Jones, M., & Scornavacca, C. (2018). Improved maximum parsimony models for phylogenetic networks. Systematic Biology, 67, 518\u2013542.","journal-title":"Systematic Biology"},{"key":"6452_CR17","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.ipl.2010.07.027","volume":"110","author":"L Van Iersel","year":"2010","unstructured":"Van Iersel, L., Semple, C., & Steel, M. (2010). Locating a tree in a phylogenetic network. Information Processing Letters, 110, 1037\u20131043.","journal-title":"Information Processing Letters"},{"key":"6452_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, P., Xu, Y., Jiang, T., Li, A., Lin, G., & Miyano, E. (2018). Improved approximation algorithms for the maximum happy vertices and edges problems. Algorithmica, 80, 1412\u20131438.","DOI":"10.1007\/s00453-017-0302-8"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06452-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06452-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06452-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T12:25:10Z","timestamp":1737980710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06452-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["6452"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06452-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,10]]},"assertion":[{"value":"17 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}