{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T07:34:11Z","timestamp":1767598451666,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,16]],"date-time":"1999-02-16T00:00:00Z","timestamp":919123200000},"content-version":"vor","delay-in-days":807,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/s0166-218x(96)00060-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"111-136","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"title":["Minimizing phylogenetic number to find good evolutionary trees"],"prefix":"10.1016","volume":"71","author":[{"given":"Leslie Ann","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia A.","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Sweedyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00060-1_BIB1","series-title":"Proceedings of the 34th Annual Symposium on Foundations of Computer Science","first-page":"1216","article-title":"A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed","volume":"23","author":"Agarwala","year":"1996"},{"key":"10.1016\/S0166-218X(96)00060-1_BIB2_1","article-title":"Fast and simple algorithms for perfect phylogeny and triangulating colored graphs","author":"Agarwala","year":"1994","journal-title":"DIMACS Tech. Report #94-51"},{"issue":"1","key":"10.1016\/S0166-218X(96)00060-1_BIB2_2","doi-asserted-by":"crossref","DOI":"10.1142\/S0129054196000038","volume":"7","author":"Agarwala","year":"1996","journal-title":"Internat. J. of Foundations of Comput. Sci"},{"year":"1974","author":"Aho","series-title":"The Design and Analysis of Computer Algorithms","key":"10.1016\/S0166-218X(96)00060-1_BIB3"},{"key":"10.1016\/S0166-218X(96)00060-1_BIB4","series-title":"Proceedings of the 19th International Congress on Automata","first-page":"273","article-title":"Two strikes against perfect phylogeny","author":"Bodlaender","year":"1992"},{"key":"10.1016\/S0166-218X(96)00060-1_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(96)00060-1_BIB6","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0022-5193(83)90296-5","article-title":"Computationally difficult parsimony problems in phylogenetic systematics","volume":"103","author":"Day","year":"1983","journal-title":"J. Theoret. Biology"},{"issue":"2","key":"10.1016\/S0166-218X(96)00060-1_BIB7","doi-asserted-by":"crossref","first-page":"224","DOI":"10.2307\/2413432","article-title":"Computational complexity of inferring phylogenies by compatibility","volume":"35","author":"Day","year":"1986","journal-title":"Syst. Zoology"},{"key":"10.1016\/S0166-218X(96)00060-1_BIB8","first-page":"343","volume":"136","author":"Exdoffier","year":"1994","journal-title":"Using allele frequencies and geographic subdivision to reconstruct gene trees within a species: molecular variance parsimony Genetics"},{"key":"10.1016\/S0166-218X(96)00060-1_BIB9","doi-asserted-by":"crossref","first-page":"406","DOI":"10.2307\/2412116","article-title":"Toward defining the course of evolution: minimum change for a specified tree topology","volume":"20","author":"Fitch","year":"1971","journal-title":"Syst. Zool."},{"issue":"3","key":"10.1016\/S0166-218X(96)00060-1_BIB10","doi-asserted-by":"crossref","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"issue":"1","key":"10.1016\/S0166-218X(96)00060-1_BIB11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","article-title":"Four Strikes Against Physical Mapping of DNA","volume":"2","author":"Goldberg","year":"1995","journal-title":"J. Comput. Biol."},{"issue":"4","key":"10.1016\/S0166-218X(96)00060-1_BIB12","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/S0097539791222171","article-title":"Inferring evolutionary history from DNA sequences","volume":"23","author":"Kannan","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00060-1_BIB13","series-title":"Proceedings 6th ACM\/SIAM Symposium on Discrete Algorithms","first-page":"595","article-title":"A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed","author":"Kannan","year":"1995"},{"key":"10.1016\/S0166-218X(96)00060-1_BIB14","first-page":"135","article-title":"Partition intersection graphs","volume":"16","author":"McMorris","year":"1983","journal-title":"Ars Combin."},{"issue":"2","key":"10.1016\/S0166-218X(96)00060-1_BIB15","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0895480192229273","article-title":"Triangulating colored graphs","volume":"7","author":"McMorris","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(96)00060-1_BIB16","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalisations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0166-218X(96)00060-1_BIB17","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. Classification"},{"key":"10.1016\/S0166-218X(96)00060-1_BIB18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/0028825X.1993.10419501","article-title":"Efficient algorithms for the character compatibility problem","volume":"31","author":"Warnow","year":"1993","journal-title":"New Zealand J. Botany"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000601?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000601?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:20Z","timestamp":1759060580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0166218X96000601"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00060-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1996,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing phylogenetic number to find good evolutionary trees","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(96)00060-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}