{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T12:07:19Z","timestamp":1780920439007,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:00:00Z","timestamp":1779321600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116057","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T05:48:17Z","timestamp":1779428897000},"page":"116057","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A strengthened bound on the number of states required to characterize maximum parsimony distance"],"prefix":"10.1016","volume":"1080","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9429-0859","authenticated-orcid":false,"given":"Mareike","family":"Fischer","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1541-8683","authenticated-orcid":false,"given":"Sofia","family":"Vazquez Alferez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2026.116057_bib0001","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/10635150802040597","article-title":"Parsimony via consensus","volume":"57","author":"Bruen","year":"2008","journal-title":"Syst. Biol."},{"key":"10.1016\/j.tcs.2026.116057_bib0002","series-title":"Reconstructing Evolution: New Mathematical and Computational Advances","article-title":"Hybridization networks","author":"Semple","year":"2007"},{"issue":"1","key":"10.1016\/j.tcs.2026.116057_bib0003","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s00026-015-0298-1","article-title":"On the maximum parsimony distance between phylogenetic trees","volume":"20","author":"Fischer","year":"2016","journal-title":"Ann. Comb."},{"key":"10.1016\/j.tcs.2026.116057_bib0004","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.aam.2015.02.002","article-title":"A parsimony-based metric for phylogenetic trees","volume":"66","author":"Moulton","year":"2015","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.116057_bib0005","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."},{"key":"10.1016\/j.tcs.2026.116057_bib0006","doi-asserted-by":"crossref","first-page":"17","DOI":"10.4137\/EBO.S419","article-title":"SPR distance computation for unrooted trees","volume":"4","author":"Hickey","year":"2008","journal-title":"Evol. Bioinform."},{"issue":"1","key":"10.1016\/j.tcs.2026.116057_bib0007","first-page":"e83","article-title":"The shape of phylogenetic treespace","volume":"66","author":"Katherine","year":"2017","journal-title":"Syst. Biol."},{"key":"10.1016\/j.tcs.2026.116057_bib0008","series-title":"Phylogenetics","author":"Semple","year":"2003"},{"issue":"1","key":"10.1016\/j.tcs.2026.116057_bib0009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-004-0200-z","article-title":"The splits in the neighborhood of a tree","volume":"8","author":"Bryant","year":"2004","journal-title":"Ann. Comb."},{"issue":"4","key":"10.1016\/j.tcs.2026.116057_bib0010","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s00026-017-0361-1","article-title":"On the complexity of computing MP distance between binary phylogenetic trees","volume":"21","author":"Kelk","year":"2017","journal-title":"Ann. Comb."},{"key":"10.1016\/j.tcs.2026.116057_bib0011","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.jcss.2020.10.003","article-title":"Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm","volume":"117","author":"Jones","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.116057_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2023.103477","article-title":"A near-linear kernel for bounded-state parsimony distance","volume":"140","author":"Deen","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116057_bib0013","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."},{"key":"10.1016\/j.tcs.2026.116057_bib0014","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.aam.2016.10.003","article-title":"A note on convex characters, Fibonacci numbers and exponential-time algorithms","volume":"84","author":"Kelk","year":"2017","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.116057_bib0015","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/TCBB.2016.2543727","article-title":"A linear bound on the number of states in optimal convex characters for maximum parsimony distance","volume":"14","author":"Boes","year":"2016","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"4","key":"10.1016\/j.tcs.2026.116057_bib0016","doi-asserted-by":"crossref","first-page":"406","DOI":"10.2307\/2412116","article-title":"Toward defining the course of evolution: minimum change for a specific tree topology","volume":"20","author":"Fitch","year":"1971","journal-title":"Syst. Zool."},{"key":"10.1016\/j.tcs.2026.116057_bib0017","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02618470","article-title":"The complexity of reconstructing trees from qualitative characters and subtrees","volume":"9","author":"Steel","year":"1992","journal-title":"J. Classif."},{"key":"10.1016\/j.tcs.2026.116057_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.orl.2025.107364","article-title":"A branch-&-price approach to the unrooted maximum agreement forest problem","volume":"63","author":"Frohn","year":"2025","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2026.116057_bib0019","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.07.010","article-title":"Reduction rules for the maximum parsimony distance on phylogenetic trees","volume":"646","author":"Kelk","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116057_bib0020","series-title":"Kernelization: Theory of Parameterized Preprocessing","author":"Fomin","year":"2019"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T11:32:10Z","timestamp":1780918330000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":20,"alternative-id":["S0304397526003075"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116057","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A strengthened bound on the number of states required to characterize maximum parsimony distance","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116057","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116057"}}