{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:37:11Z","timestamp":1776317831441,"version":"3.50.1"},"reference-count":20,"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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6072,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/s0166-218x(96)00062-5","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"153-169","source":"Crossref","is-referenced-by-count":173,"title":["On the complexity of comparing evolutionary trees"],"prefix":"10.1016","volume":"71","author":[{"given":"Jotun","family":"Hein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00062-5_BIB1","series-title":"Proceedings of the 35th IEEE Symp. Found. Comput. Sci.","article-title":"Maximum agreement subtree in a set of evolutionary trees \u2014 metrics and efficient algorithms","author":"Amir","year":"1994"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB2","series-title":"Proceedings of the 33rd IEEE Symp. Found. Comput. Sci.","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0025-5564(76)90035-3","article-title":"A mathematical foundation for the analysis of cladistic character compatibility","volume":"29","author":"Estabrook","year":"1976","journal-title":"Math. Biosci."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB4","series-title":"Proceedings of the 5th Ann. ACM-SIAM Symp. Discrete Algorithms","article-title":"Fast comparison of evolutionary trees","author":"Farach","year":"1994"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB5","series-title":"Proceedings of the 35th IEEE Symp. Found. Comput. Sci.","article-title":"Optimal evolutionary tree comparison by sparse dynamic programming","author":"Farach","year":"1994"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01908078","article-title":"Obtaining common pruned trees","volume":"2","author":"Finden","year":"1985","journal-title":"J. Classification"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB7","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","article-title":"Efficient algorithms for inferring evolutionary trees","volume":"21","author":"Gusfield","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB9","article-title":"Finding a maximum compatible tree is NP-hard","author":"Hamel","year":"1994"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0025-5564(90)90123-G","article-title":"Reconstructing evolution of sequences subject to recombination using parsimony","volume":"98","author":"Hein","year":"1990","journal-title":"Math. Biosci."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB11","first-page":"396","article-title":"A heuristic method to reconstruct the history of sequences subject to recombination","volume":"36","author":"Hein","year":"1993","journal-title":"J. Mol. Evo."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB12","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1137\/S009753979223842X","article-title":"On the approximation of shortest common supersequences and longest common subsequences","volume":"24","author":"Jiang","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","article-title":"Alignment of trees\u2014an alternative to tree edit","volume":"143-1","author":"Jiang","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAX SNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB15","series-title":"Proceedings of the 5th Ann. ACM-SIAM Symp. Discrete Algorithms","article-title":"Reconstructing a history of recombinations from a set of sequences","author":"Kececioglu","year":"1994"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB16","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","article-title":"Kaikoura tree theorems: computing the maximum agreement subtree","volume":"48","author":"Steel","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB18","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1006\/jagm.1994.1018","article-title":"Tree compatibility and inferring evolutionary history","volume":"16","author":"Warnow","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(96)00062-5_BIB19","unstructured":"T. Warnow, Private communication (1994)."},{"key":"10.1016\/S0166-218X(96)00062-5_BIB20","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000625?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000625?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:51Z","timestamp":1556130471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0166218X96000625"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00062-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}