{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:02:39Z","timestamp":1780495359101,"version":"3.54.1"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:00:00Z","timestamp":1774051200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002429","name":"Universities of the Netherlands","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002429","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Dutch Research Council","doi-asserted-by":"publisher","award":["OCENW.KLEIN.305"],"award-info":[{"award-number":["OCENW.KLEIN.305"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.jcss.2026.103800","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:18:24Z","timestamp":1774397904000},"page":"103800","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests"],"prefix":"10.1016","volume":"160","author":[{"given":"David","family":"Mestel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Chaplick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruben","family":"Meuwese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.jcss.2026.103800_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","article-title":"Subtree transfer operations and their induced metrics on evolutionary trees","volume":"5","author":"Allen","year":"2001","journal-title":"Ann. Comb."},{"issue":"3","key":"10.1016\/j.jcss.2026.103800_br0020","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.jda.2007.10.002","article-title":"A 3-approximation algorithm for the subtree distance between phylogenies","volume":"6","author":"Bordewich","year":"2008","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"10.1016\/j.jcss.2026.103800_br0030","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","article-title":"On the computational complexity of the rooted subtree prune and regraft distance","volume":"8","author":"Bordewich","year":"2004","journal-title":"Ann. Comb."},{"issue":"8","key":"10.1016\/j.jcss.2026.103800_br0040","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.dam.2006.08.008","article-title":"Computing the minimum number of hybridization events for a consistent evolutionary history","volume":"155","author":"Bordewich","year":"2007","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"10.1016\/j.jcss.2026.103800_br0050","doi-asserted-by":"crossref","first-page":"256","DOI":"10.3390\/a12120256","article-title":"Parameterized algorithms in bioinformatics: an overview","volume":"12","author":"Bulteau","year":"2019","journal-title":"Algorithms"},{"key":"10.1016\/j.jcss.2026.103800_br0060","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.tcs.2014.10.031","article-title":"Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees","volume":"562","author":"Chen","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103800_br0070","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s10878-013-9695-8","article-title":"Faster exact computation of rSPR distance","volume":"29","author":"Chen","year":"2015","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.jcss.2026.103800_br0080","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1093\/sysbio\/20.4.406","article-title":"Toward defining the course of evolution: minimum change for a specific tree topology","volume":"20","author":"Fitch","year":"1971","journal-title":"Syst. Biol."},{"issue":"3","key":"10.1016\/j.jcss.2026.103800_br0090","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00224-007-1329-z","article-title":"A faster fpt algorithm for the maximum agreement forest problem","volume":"41","author":"Hallett","year":"2007","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"10.1016\/j.jcss.2026.103800_br0100","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","article-title":"On the complexity of comparing evolutionary trees","volume":"71","author":"Hein","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2026.103800_br0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114608","article-title":"Agreement forests of caterpillar trees: complexity, kernelization and branching","volume":"1003","author":"Kelk","year":"2024","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103800_br0120","series-title":"25th Annual European Symposium on Algorithms (ESA 2017)","article-title":"Computing maximum agreement forests without cluster partitioning is folly","author":"Li","year":"2017"},{"key":"10.1016\/j.jcss.2026.103800_br0130","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.jcss.2018.03.002","article-title":"A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees","volume":"97","author":"Shi","year":"2018","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2026.103800_br0140","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10479-021-04352-1","article-title":"Reflections on kernelizing and computing unrooted agreement forests","volume":"309","author":"van Wersch","year":"2022","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.jcss.2026.103800_br0150","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1137\/110845045","article-title":"Fixed-parameter algorithms for maximum agreement forests","volume":"42","author":"Whidden","year":"2013","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.jcss.2026.103800_br0160","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1109\/TCBB.2018.2802911","article-title":"Calculating the unrooted subtree prune-and-regraft distance","volume":"16","author":"Whidden","year":"2018","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10.1016\/j.jcss.2026.103800_br0170","series-title":"International Workshop on Algorithms in Bioinformatics (WABI 2009)","first-page":"390","article-title":"A unifying view on approximation and FPT of agreement forests","author":"Whidden","year":"2009"},{"issue":"4","key":"10.1016\/j.jcss.2026.103800_br0180","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1093\/sysbio\/syu023","article-title":"Supertrees based on the subtree prune-and-regraft distance","volume":"63","author":"Whidden","year":"2014","journal-title":"Syst. Biol."},{"key":"10.1016\/j.jcss.2026.103800_br0190","series-title":"19th International Workshop on Algorithms in Bioinformatics (WABI 2019)","article-title":"Better practical algorithms for rSPR distance and hybridization number","author":"Yamada","year":"2019"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000462?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000462?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:00:59Z","timestamp":1780491659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":19,"alternative-id":["S0022000026000462"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103800","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103800","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"103800"}}