{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:36:54Z","timestamp":1773272214225,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":3516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0022-0000(03)00077-1","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T22:14:27Z","timestamp":1058912067000},"page":"723-741","source":"Crossref","is-referenced-by-count":24,"title":["A fixed-parameter algorithm for minimum quartet inconsistency"],"prefix":"10.1016","volume":"67","author":[{"given":"Jens","family":"Gramm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1-3","key":"10.1016\/S0022-0000(03)00077-1_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00199-0","article-title":"Faster exact solutions for hard problems","volume":"229","author":"Alber","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","article-title":"Reconstructing the shape of a tree from observed dissimilarity data","volume":"7","author":"Bandelt","year":"1986","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1089\/cmb.1998.5.377","article-title":"Constructing phylogenies from quartets","volume":"5","author":"Ben-Dor","year":"1998","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB4","unstructured":"V. Berry, D. Bryant, T. Jiang, P. Kearney, M. Li, T. Wareham, H. Zhang, A practical algorithm for recovering the best supported edges of an evolutionary tree, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, Philadelphia, 2000, pp. 287\u2013296."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0304-3975(99)00235-2","article-title":"Inferring evolutionary trees with strong combinatorial evidence","volume":"240","author":"Berry","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB6","doi-asserted-by":"crossref","unstructured":"V. Berry, T. Jiang, P. Kearney, M. Li, T. Wareham, Quartet cleaning: improved algorithms and simulations, in: Proceedings of the Seventh European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Vol. 1643, Springer, Berlin, 1999, pp. 313\u2013324.","DOI":"10.1007\/3-540-48481-7_28"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/jagm.2000.1133","article-title":"Constructing optimal trees from quartets","volume":"38","author":"Bryant","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB8","unstructured":"P. Buneman, The recovery of trees from measures of dissimilarity, in: Hodson, et al. (Eds.), Anglo-Romanian Conference on Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press, Edinburgh, 1971, pp. 387\u2013395."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB9","doi-asserted-by":"crossref","unstructured":"B. Chor, From quartets to phylogenetic trees, in: Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM), Lecture Notes in Computer Science, Vol. 1521, Springer, Berlin, 1998, pp. 36\u201353.","DOI":"10.1007\/3-540-49477-4_3"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB10","unstructured":"B. Chor, Personal communication, August 2001."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1111\/j.2044-8317.1981.tb00626.x","article-title":"Tree structure for proximity data","volume":"34","author":"Colonius","year":"1981","journal-title":"British J. Math. Statist. Psych."},{"issue":"10","key":"10.1016\/S0022-0000(03)00077-1_BIB12","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1093\/bioinformatics\/18.10.1297","article-title":"Optimal algorithms for local vertex quartet cleaning","volume":"18","author":"Della Vedova","year":"2002","journal-title":"Bioinformatics"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB13","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB14","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: a framework for systematically confronting computational intractability, in: Graham, et al. (Eds.), Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 49, Am. Math. Soc. Press, Providence, RI, 1999, pp. 49\u201399.","DOI":"10.1090\/dimacs\/049\/04"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB15","doi-asserted-by":"crossref","unstructured":"M.R. Fellows, Parameterized complexity: the main ideas and some research frontiers, in: Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, Vol. 2223, Springer, Berlin, 2001, pp. 291\u2013307.","DOI":"10.1007\/3-540-45678-3_26"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB16","unstructured":"J. Felsenstein, PHYLIP (Phylogeny Inference Package) version 3.5c, Distributed by the author, Department of Genetics, University of Washington, Seattle, 1993. Available through http:\/\/evolution.genetics.washington.edu\/phylip."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB17","doi-asserted-by":"crossref","unstructured":"J. Gramm, R. Niedermeier. Minimum Quartet Inconsistency is fixed parameter tractable, Technical Report WSI-2001-3, WSI f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Federal Republic of Germany, January 2001.","DOI":"10.1007\/3-540-48194-X_23"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB18","doi-asserted-by":"crossref","unstructured":"T. Jiang, P. Kearney, M. Li, Orchestrating quartets: approximation and data correction, in: Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), 1998, pp. 416\u2013425.","DOI":"10.1109\/SFCS.1998.743492"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB19","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1006\/jagm.1999.1050","article-title":"Some open problems in computational molecular biology","volume":"34","author":"Jiang","year":"2000","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/S0022-0000(03)00077-1_BIB20","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1137\/S0097539799361683","article-title":"A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application","volume":"30","author":"Jiang","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB21","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1006\/jagm.1998.0996","article-title":"Parameterizing above guaranteed values","volume":"31","author":"Mahajan","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB22","doi-asserted-by":"crossref","unstructured":"R. Niedermeier, P. Rossmanith, An efficient fixed parameter algorithm for 3-Hitting Set, J. Discrete Algorithms, to appear, 2003.","DOI":"10.1016\/S1570-8667(03)00009-1"},{"key":"10.1016\/S0022-0000(03)00077-1_BIB23","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\/S0022-0000(03)00077-1_BIB24","unstructured":"M. Steel, Personal communication, May 2001."},{"issue":"7","key":"10.1016\/S0022-0000(03)00077-1_BIB25","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","article-title":"Quartet puzzling","volume":"13","author":"Strimmer","year":"1996","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB26","unstructured":"M. Wei\u00df, Molecular investigations on phylogeny in the genus Amanita, Dissertation, Universit\u00e4t T\u00fcbingen, Federal Republic of Germany, 1999."},{"key":"10.1016\/S0022-0000(03)00077-1_BIB27","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1139\/cjb-76-7-1170","article-title":"Molecular phylogenetic studies in the genus Amanita","volume":"76","author":"Wei\u00df","year":"1998","journal-title":"Canad. J. Bot."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000771?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000771?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T10:21:53Z","timestamp":1552818113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0022000003000771"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00077-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}