{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T01:15:03Z","timestamp":1774142103739,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00235-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:58:49Z","timestamp":1027605529000},"page":"271-298","source":"Crossref","is-referenced-by-count":53,"title":["Inferring evolutionary trees with strong combinatorial evidence"],"prefix":"10.1016","volume":"240","author":[{"given":"Vincent","family":"Berry","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Gascuel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00235-2_BIB1","unstructured":"R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, M. Thorup, On the approximability of numerical taxonomy: fitting distances by tree metrics, in: Proc. 7th ACM\u2013SIAM SODA, 1996."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB2","first-page":"1","article-title":"Probability distributions on cladograms","volume":"vol. 76","author":"Aldous","year":"1995"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB3","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB4","unstructured":"A. Ambainis, R. Desper, M. Farach, S. Kannan, Nearly tight bounds on the learnability of evolution, in: IEEE Symp. on Foundations of Computer Science, 1998."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB5","series-title":"Proc. COCOON, Computing and Combinatorics","first-page":"101","article-title":"The performance of neighbor-joining algorithms of phylogeny reconstruction","author":"Atteson","year":"1997"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB6","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\/S0304-3975(99)00235-2_BIB7","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\/S0304-3975(99)00235-2_BIB8","series-title":"Trees and Proximities Representations","author":"Barth\u00e9lemy","year":"1991"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB9","series-title":"M\u00e9thodes et Algorithmes pour reconstruire les arbres de l\u2019\u00c9volution, Ph.D. Thesis","author":"Berry","year":"1997"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB10","doi-asserted-by":"crossref","unstructured":"V. Berry, D. Bryant, Faster reliable phylogenetic analysis, Proc. RECOMB\u201999, pp. 59\u201368, ACM Press, 1999.","DOI":"10.1145\/299432.299457"},{"issue":"7","key":"10.1016\/S0304-3975(99)00235-2_BIB11","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1093\/molbev\/13.7.999","article-title":"On the interpretation of bootstrap trees","volume":"13","author":"Berry","year":"1996","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB12","unstructured":"V. Berry, O. Gascuel, Reconstructing phylogenies from resolved 4-trees, Tech. Rep. 97076, LIRMM, 1997."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0893-9659(98)00148-7","article-title":"A polynomial time algorithm for constructing the refined buneman tree","volume":"12","author":"Bryant","year":"1999","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB14","series-title":"Mathematics in Archeological and Historical Sciences","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","author":"Buneman","year":"1971"},{"issue":"B","key":"10.1016\/S0304-3975(99)00235-2_BIB15","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0095-8956(74)90047-1","article-title":"A note on metric properties of trees","volume":"17","author":"Buneman","year":"1974","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0025-5564(78)90089-5","article-title":"Taxonomy with confidence","volume":"40","author":"Cavender","year":"1978","journal-title":"Math. Biosci."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB17","doi-asserted-by":"crossref","unstructured":"V. Chepoi, B. Fichet, L\u221e approximation via subdominants, J. Math. Psychol. (1999), to appear.","DOI":"10.1006\/jmps.1999.1270"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1111\/j.2044-8317.1981.tb00626.x","article-title":"Tree structures for proximity data","volume":"34","author":"Colonius","year":"1981","journal-title":"British J. Math. Statist. Psycho."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB19","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF02458863","article-title":"Computational complexity of inferring phylogenies from dissimilarity matrices","volume":"49","author":"Day","year":"1987","journal-title":"Bull. Math. Biol."},{"issue":"2","key":"10.1016\/S0304-3975(99)00235-2_BIB20","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. Zool."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB21","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1038\/381597a0","article-title":"The guinea-pig is not a rodent","volume":"381","author":"d'Erchia","year":"1996","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB22","doi-asserted-by":"crossref","unstructured":"P.L. Erd\u00f6s, M.A. Steel, L.A. Szkely, T.J. Warnow, Constructing big trees from short sequences, in: 24th Internat. Colloquium on Automata Languages and Programming, 1997.","DOI":"10.1007\/3-540-63165-8_235"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB23","doi-asserted-by":"crossref","unstructured":"M. Farach, S. Kannan, Efficient algorithms for inverting evolution, in: Proc. 28th Ann. ACM Symp. on Theory of Computing, 1996, pp. 230\u2013236.","DOI":"10.1145\/237814.237868"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB24","doi-asserted-by":"crossref","first-page":"250","DOI":"10.2307\/2412305","article-title":"A probability model for inferring evolutionary trees","volume":"22","author":"Farris","year":"1973","journal-title":"Syst. Zool."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.2307\/2412923","article-title":"Cases in which parsimony and compatibility methods will be positively misleading","volume":"27","author":"Felsenstein","year":"1978","journal-title":"Syst. Zool."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB26","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1146\/annurev.ge.22.120188.002513","article-title":"Phylogenies from molecular sequences","volume":"22","author":"Felsenstein","year":"1988","journal-title":"Annu. Rev. Genet."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB27","series-title":"Phylip (phylogeny inference package) version 3.5c, Department of Genetics","author":"Felsenstein","year":"1993"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB28","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01202585","article-title":"A reduction for approximating a (non-metric) dissimilarity by a tree distance","volume":"13","author":"Gascuel","year":"1996","journal-title":"J. Classification"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB29","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1038\/351649a0","article-title":"Is the guinea-pig a rodent?","volume":"351","author":"Graur","year":"1991","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB30","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","article-title":"Efficient algorithms for inferring evolutionnary trees","volume":"21","author":"Gusfield","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB31","first-page":"44","article-title":"The probabilities of rooted tree shapes generated by random bifurcation","volume":"3","author":"Harding","year":"1971","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB32","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"issue":"3","key":"10.1016\/S0304-3975(99)00235-2_BIB33","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1093\/sysbio\/42.3.247","article-title":"Success of phylogenetic methods in the four-taxon case","volume":"42","author":"Hillis","year":"1993","journal-title":"Syst. Biol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB34","first-page":"21","article-title":"Evolution of protein molecules","volume":"vol. III, Ch. 24","author":"Jukes","year":"1969"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB35","unstructured":"P. Kearney, Ordinal beats additive, in: Second Annual Internat. Conf. on Computational Molecular Biology (RECOMB), 1998."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB36","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01731581","article-title":"A simple method for estimating evolutionary rates base substitutions through comparative studies of nucleotide sequences","volume":"16","author":"Kimura","year":"1980","journal-title":"J. Mol. Evol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB37","first-page":"459","article-title":"A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates","volume":"11","author":"Kuhner","year":"1994","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB38","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1093\/oxfordjournals.molbev.a025618","article-title":"A stepwise algorithm for finding minimum evolution trees","volume":"13","author":"Kumar","year":"1996","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB39","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/mpev.1993.1021","article-title":"Species sampling has a major impact on phylogenetic inference","volume":"2","author":"Lecointre","year":"1993","journal-title":"Mol. Phylogenet. Evol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB40","doi-asserted-by":"crossref","first-page":"591","DOI":"10.2307\/1219940","article-title":"A manual method for character compatibility","volume":"30","author":"Meacham","year":"1981","journal-title":"Taxon"},{"issue":"1\u20133","key":"10.1016\/S0304-3975(99)00235-2_BIB41","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0166-218X(98)00128-0","article-title":"Retractions of finite distance functions onto tree metrics","volume":"91","author":"Moulton","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB42","series-title":"Phylogenetic Analysis of DNA Sequences","article-title":"Relative efficiencies of different tree-making methods for molecular data","author":"Nei","year":"1991"},{"key":"10.1016\/S0304-3975(99)00235-2_BIB43","series-title":"Phylogenetic Analysis of DNA Sequences","first-page":"155","article-title":"Testing the theory of descent","author":"Penny","year":"1991"},{"issue":"4","key":"10.1016\/S0304-3975(99)00235-2_BIB44","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstruction phylogenetic trees","volume":"4","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB45","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02293654","article-title":"Additive similarity trees","volume":"42","author":"Sattah","year":"1977","journal-title":"Psychom."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB46","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"},{"issue":"7","key":"10.1016\/S0304-3975(99)00235-2_BIB47","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\/S0304-3975(99)00235-2_BIB48","series-title":"Molecular Systematics","first-page":"407","article-title":"Phylogenetic inference","author":"Swofford","year":"1996"},{"issue":"3","key":"10.1016\/S0304-3975(99)00235-2_BIB49","first-page":"269","article-title":"Estimation of evolution distance between nucleotide sequences","volume":"1","author":"Tajima","year":"1984","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00235-2_BIB50","unstructured":"T. Warnow, Personal communication, 1997."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002352?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002352?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:37:18Z","timestamp":1578519438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002352"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00235-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}