{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:46Z","timestamp":1770921406692,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_25","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:18Z","timestamp":1770918798000},"page":"332-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Low Scanwidth to Resolve Soft Polytomies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7413-4263","authenticated-orcid":false,"given":"Sebastian","family":"Bruchhold","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9653-3690","authenticated-orcid":false,"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Bentert, M., Mal\u00edk, J., Weller, M.: Tree containment with soft polytomies. In: 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0101, pp. 9:1\u20139:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2018.9","DOI":"10.4230\/LIPIcs.SWAT.2018.9"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"417","DOI":"10.7155\/jgaa.00565","volume":"25","author":"M Bentert","year":"2021","unstructured":"Bentert, M., Weller, M.: Tree containment with soft polytomies. J. Graph Algorithms Appl. 25(1), 417\u2013436 (2021). https:\/\/doi.org\/10.7155\/jgaa.00565","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-38919-2_42","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"V Berry","year":"2020","unstructured":"Berry, V., Scornavacca, C., Weller, M.: Scanning phylogenetic networks is NP-hard. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 519\u2013530. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_42https:\/\/hal.science\/hal-02353161v2"},{"key":"25_CR4","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11(1\u20132), 1\u201321 (1993). https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/3417"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.aam.2016.04.004","volume":"78","author":"M Bordewich","year":"2016","unstructured":"Bordewich, M., Semple, C.: Reticulation-visible networks. Adv. Appl. Math. 78, 114\u2013141 (2016). https:\/\/doi.org\/10.1016\/j.aam.2016.04.004","journal-title":"Adv. Appl. Math."},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Bruchhold, S., Weller, M.: Exploiting low scanwidth to resolve soft polytomies (2025). https:\/\/doi.org\/10.48550\/arXiv.2511.20771","DOI":"10.48550\/arXiv.2511.20771"},{"issue":"46","key":"25_CR7","doi-asserted-by":"publisher","first-page":"18566","DOI":"10.1073\/pnas.1313480110","volume":"110","author":"JM Chan","year":"2013","unstructured":"Chan, J.M., Carlsson, G., Rabadan, R.: Topology of viral evolution. Proc. Natl. Acad. Sci. 110(46), 18566\u201318571 (2013). https:\/\/doi.org\/10.1073\/pnas.1313480110","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/12086217X","volume":"42","author":"R Chitnis","year":"2013","unstructured":"Chitnis, R., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SIAM J. Comput. 42(4), 1674\u20131696 (2013). https:\/\/doi.org\/10.1137\/12086217X","journal-title":"SIAM J. Comput."},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Fakcharoenphol, J., Kumpijit, T., Putwattana, A.: A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks. In: 12th International Joint Conference on Computer Science and Software Engineering (JCSSE\u201915), pp. 337\u2013342. IEEE (2015). https:\/\/doi.org\/10.1109\/JCSSE.2015.7219820","DOI":"10.1109\/JCSSE.2015.7219820"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-16706-0_12","volume-title":"Research in Computational Molecular Biology","author":"P Gambette","year":"2015","unstructured":"Gambette, P., Gunawan, A.D.M., Labarre, A., Vialette, S., Zhang, L.: Locating a tree in a phylogenetic network in quadratic time. In: Przytycka, T.M. (ed.) RECOMB 2015. LNCS, vol. 9029, pp. 96\u2013107. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16706-0_12"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Gunawan, A.D.M.: Solving tree containment problem for reticulation-visible networks with optimal running time (2017). https:\/\/doi.org\/10.48550\/arXiv.1702.04088","DOI":"10.48550\/arXiv.1702.04088"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Gunawan, A.D.M., DasGupta, B., Zhang, L.: A decomposition theorem and two algorithms for reticulation-visible networks. Inf. Comput. 252, 161\u2013175 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.11.001","DOI":"10.1016\/j.ic.2016.11.001"},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Gusfield, D.: ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks. MIT Press, Cambridge (2014). https:\/\/doi.org\/10.7551\/mitpress\/9432.001.0001","DOI":"10.7551\/mitpress\/9432.001.0001"},{"key":"25_CR14","unstructured":"Holtgrefe, N.: Computing the Scanwidth of Directed Acyclic Graphs. Master\u2019s thesis, Delft University of Technology (2023). http:\/\/resolver.tudelft.nl\/uuid:9c82fd2a-5841-4aac-8e40-d4d22542cdf5"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, Cambridge (2010). https:\/\/doi.org\/10.1017\/CBO9780511974076","DOI":"10.1017\/CBO9780511974076"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"van Iersel, L., Jones, M., Weller, M.: Embedding phylogenetic trees in networks of low treewidth. Discrete Math. Theor. Comput. Sci. 25(2), 4 (2023). https:\/\/doi.org\/10.46298\/dmtcs.10116","DOI":"10.46298\/dmtcs.10116"},{"key":"25_CR17","unstructured":"van Iersel, L., Jones, M., Weller, M.: Tree and network containment parameterized by scanwidth (2025). unpublished manuscript"},{"issue":"23","key":"25_CR18","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.: Locating a tree in a phylogenetic network. Inf. Process. Lett. 110(23), 1037\u20131043 (2010). https:\/\/doi.org\/10.1016\/j.ipl.2010.07.027","journal-title":"Inf. Process. Lett."},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Janssen, R., Murakami, Y.: On cherry-picking and network containment. Theor. Comput. Sci. 856, 121\u2013150 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.12.031","DOI":"10.1016\/j.tcs.2020.12.031"},{"issue":"1\u20133","key":"25_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2008.04.019","volume":"401","author":"IA Kanj","year":"2008","unstructured":"Kanj, I.A., Nakhleh, L., Than, C., Xia, G.: Seeing the trees and their branches in the network is hard. Theoret. Comput. Sci. 401(1\u20133), 153\u2013164 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2008.04.019","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Magne, L., Paul, C., Sharma, A., Thilikos, D.M.: Edge-treewidth: algorithmic and combinatorial properties. Discr. Appl. Math. 341, 40\u201354 (2023). https:\/\/doi.org\/10.1016\/j.dam.2023.07.023","DOI":"10.1016\/j.dam.2023.07.023"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Reed, B.: Introducing directed tree width. Electronic Notes in Discrete Mathematics 3, 222\u2013229 (1999). https:\/\/doi.org\/10.1016\/S1571-0653(05)80061-7. 6th Twente Workshop on Graphs and Combinatorial Optimization","DOI":"10.1016\/S1571-0653(05)80061-7"},{"key":"25_CR23","doi-asserted-by":"publisher","unstructured":"Safari, M.A.: D-width: A more natural measure for directed tree width. In: Mathematical Foundations of Computer Science 2005, pp. 745\u2013756. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_64","DOI":"10.1007\/11549345_64"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/s13015-022-00216-w","volume":"17","author":"C Scornavacca","year":"2022","unstructured":"Scornavacca, C., Weller, M.: Treewidth-based algorithms for the small parsimony problem on networks. Algorithms Mol. Biol. 17, 15 (2022). https:\/\/doi.org\/10.1186\/s13015-022-00216-w","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"25_CR25","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1001284","volume":"7","author":"TJ Treangen","year":"2011","unstructured":"Treangen, T.J., Rocha, E.P.C.: Horizontal transfer, not duplication, drives the expansion of protein families in prokaryotes. PLoS Genet. 7(1), e1001284 (2011). https:\/\/doi.org\/10.1371\/journal.pgen.1001284","journal-title":"PLoS Genet."},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-00834-5_18","volume-title":"Comparative Genomics","author":"M Weller","year":"2018","unstructured":"Weller, M.: Linear-time tree containment in phylogenetic networks. In: Blanchette, M., Ouangraoua, A. (eds.) RECOMB-CG 2018. LNCS, vol. 11183, pp. 309\u2013323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00834-5_18"},{"issue":"7","key":"25_CR27","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1089\/cmb.2015.0228","volume":"23","author":"L Zhang","year":"2016","unstructured":"Zhang, L.: On tree-based phylogenetic networks. J. Comput. Biol. 23(7), 553\u2013565 (2016). https:\/\/doi.org\/10.1089\/cmb.2015.0228","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:20Z","timestamp":1770918800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}