{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:28:58Z","timestamp":1662172138282},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":3911,"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":[[2002,11]]},"DOI":"10.1016\/s0022-0000(02)00005-3","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T13:45:29Z","timestamp":1043156729000},"page":"481-493","source":"Crossref","is-referenced-by-count":8,"title":["Combining polynomial running time and fast convergence for the disk-covering method"],"prefix":"10.1016","volume":"65","author":[{"given":"J.","family":"Lagergren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(02)00005-3_BIB1","doi-asserted-by":"crossref","unstructured":"R. Agarwala, V. Bafna, M. Farach, M. Paterson, M. Thorup, On the approximability of numerical taxonomy (fitting distances by tree metrics), SIAM J. Comput. 28(3) (1999) 1073\u20131085.","DOI":"10.1137\/S0097539795296334"},{"key":"10.1016\/S0022-0000(02)00005-3_BIB2","doi-asserted-by":"crossref","unstructured":"A. Ambainis, R. Desper, M. Farach, S. Kannan, Nearly tight bounds on the learnability of evolution, in: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, IEEE Press, New York, 1997, pp. 524\u2013533.","DOI":"10.1109\/SFCS.1997.646141"},{"key":"10.1016\/S0022-0000(02)00005-3_BIB3","doi-asserted-by":"crossref","unstructured":"K. Atteson, The performance of neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25(2\u20133) (1999) 251\u2013278.","DOI":"10.1007\/PL00008277"},{"issue":"1","key":"10.1016\/S0022-0000(02)00005-3_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","article-title":"A canonical decomposition theory for metrics on a finite set","volume":"92","author":"Bandelt","year":"1992","journal-title":"Adv. Math."},{"key":"10.1016\/S0022-0000(02)00005-3_BIB5","unstructured":"V. Berry, O. Gasquel, Infering evolutionary trees with strong combinatorial evidence, in: COCOON\u201997, Lecture Notes in Computer Science, Vol. 1276, Springer-Verlag, Berlin, 1997, pp. 387\u2013395."},{"key":"10.1016\/S0022-0000(02)00005-3_BIB6","series-title":"Mathematics in the Archeological and Historical Sciences","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","author":"Buneman","year":"1971"},{"key":"10.1016\/S0022-0000(02)00005-3_BIB7","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\/S0022-0000(02)00005-3_BIB8","doi-asserted-by":"crossref","unstructured":"M. Cryan, L.A. Goldberg, P.W. Goldberg, Evolutionary trees can be learned in polynomial time in the two-state general markov model, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 436\u2013447.","DOI":"10.1109\/SFCS.1998.743494"},{"key":"10.1016\/S0022-0000(02)00005-3_BIB9","doi-asserted-by":"crossref","unstructured":"M. Cs\u00fcr\u00f6s, Fast recovery of evolutionary trees with thousands of nodes, in: Proceedings of the Fifth International Conference on Computational Biology (RECOMB), 2001, pp. 104\u2013113.","DOI":"10.1145\/369133.369178"},{"key":"10.1016\/S0022-0000(02)00005-3_BIB10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01908061","article-title":"Optimal algorithmic for comparing trees with labeled leaves","volume":"2","author":"Day","year":"1995","journal-title":"J. Class."},{"issue":"14","key":"10.1016\/S0022-0000(02)00005-3_BIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","article-title":"A few logs suffices to build (almost) all trees (I)","volume":"2","author":"Erd\u00f6s","year":"1999","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"10.1016\/S0022-0000(02)00005-3_BIB12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/320211.320212","article-title":"Efficient algorithms for inverting evolution","volume":"46","author":"Farach","year":"1999","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(02)00005-3_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"3\/4","key":"10.1016\/S0022-0000(02)00005-3_BIB14","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1089\/106652799318337","article-title":"Disk-covering, a fast-converging method for phylogenetic tree construction","volume":"6","author":"Huson","year":"1999","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0022-0000(02)00005-3_BIB15","doi-asserted-by":"crossref","unstructured":"L. Nakleh, U. Roshan, K.St. John, J. Sun, T. Warnow, Designing fast converging phylogenetic methods, in: Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology (ISMB), 2001, pp. 190\u2013198.","DOI":"10.1093\/bioinformatics\/17.suppl_1.S190"},{"key":"10.1016\/S0022-0000(02)00005-3_BIB16","unstructured":"D.L. Swofford, G.J. Olsen, P.J. Waddell, D.M. Hillis, Phylogenetic inference (chapter), in: D.M. Hillis, C. Moritz, and B.K. Mable (Eds.), Molecular Systematics, Sinauer, MA, 1996, pp. 407\u2013425."},{"key":"10.1016\/S0022-0000(02)00005-3_BIB17","unstructured":"T.J. Warnow, B.M.E. Moret, K.St. John, Absolute convergence: true trees from short sequences, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 186\u2013195."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T02:04:35Z","timestamp":1583978675000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0022000002000053"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00005-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}