{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T01:21:21Z","timestamp":1780622481121,"version":"3.54.1"},"reference-count":64,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["T 016 358"],"award-info":[{"award-number":["T 016 358"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["T 019 367"],"award-info":[{"award-number":["T 019 367"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 970121 l"],"award-info":[{"award-number":["DMS 970121 l"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-9457800"],"award-info":[{"award-number":["CCR-9457800"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000008","name":"David and Lucile Packard Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00028-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"77-118","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":98,"title":["A few logs suffice to build (almost) all trees: Part II"],"prefix":"10.1016","volume":"221","author":[{"given":"P\u00e9ter L.","family":"Erd\u00f6s","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Steel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L\u00e1szl\u00f3A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tandy J.","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00028-6_bib1","series-title":"Proc. 7th Annual ACM-SIAM Symp. on Discrete Algorithms","first-page":"365","article-title":"On the approximability of numerical taxonomy: fitting distances by tree metrics","author":"Agarwala","year":"1996"},{"key":"10.1016\/S0304-3975(99)00028-6_bib2","series-title":"Discrete Random Structures","first-page":"1","article-title":"Probability distributions on cladograms","volume":"vol. 76","author":"Aldous","year":"1995"},{"key":"10.1016\/S0304-3975(99)00028-6_bib3","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0304-3975(99)00028-6_bib4","series-title":"38th Annual Symp. on Foundations of Computer Science","first-page":"524","article-title":"Nearly tight bounds on the learnability of evolution","author":"Ambainis","year":"1997"},{"key":"10.1016\/S0304-3975(99)00028-6_bib5","series-title":"Computing and Combinatorics, 3rd Annual Internat. Conf., COCOON'97","first-page":"101","article-title":"The performance of neighbor-joining algorithms of phylogeny reconstruction","volume":"vol. 1276","author":"Atteson","year":"1997"},{"key":"10.1016\/S0304-3975(99)00028-6_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)00028-6_bib7","series-title":"Computing and Combinatorics, 3rd Annual Internat. Conf., COCOON'97","first-page":"111","article-title":"Inferring evolutionary trees with strong combinatorial evidence","volume":"vol. 1276","author":"Berry","year":"1997"},{"key":"10.1016\/S0304-3975(99)00028-6_bib8","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1093\/sysbio\/43.1.78","article-title":"Probabilities of evolutionary trees","volume":"43","author":"Brown","year":"1994","journal-title":"Syst. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1006\/aama.1995.1020","article-title":"Extension operations on sets of leaf-labelled trees","volume":"16","author":"Bryant","year":"1995","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0304-3975(99)00028-6_bib10","series-title":"Mathematics in the Archaeological and Historical Sciences","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","author":"Buneman","year":"1971"},{"key":"10.1016\/S0304-3975(99)00028-6_bib11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1137\/0403005","article-title":"On the distribution of lengths of evolutionary trees","volume":"3","author":"Carter","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(99)00028-6_bib12","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)00028-6_bib13","series-title":"Computing Science and Statistics: Proc. 23rd Symp. on the Interface","first-page":"254","article-title":"Reconstruction of evolutionary trees from pairwise distributions on current species","author":"Chang","year":"1991"},{"key":"10.1016\/S0304-3975(99)00028-6_bib14","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":"Br. J. Math. Statist. Psychol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib15","series-title":"Proc. 39th Annual IEEE Symp. on Foundations of Computer Science","first-page":"436","article-title":"Evolutionary trees can be learned in polynomial time in the two-state general Markov-model","author":"Cryan","year":"1998"},{"key":"10.1016\/S0304-3975(99)00028-6_bib16","series-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms","first-page":"261","article-title":"Fast reconstruction of evolutionary trees through Harmonic Greedy Triplets","author":"Csuros","year":"1999"},{"key":"10.1016\/S0304-3975(99)00028-6_bib17","first-page":"215","article-title":"Computational complexity of inferring phylogenies from dissimilarities matrices","volume":"30","author":"Day","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(99)00028-6_bib18","first-page":"217","article-title":"Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule","volume":"16","author":"Erd\u00f6s","year":"1997","journal-title":"Comput. Artif. Intell."},{"key":"10.1016\/S0304-3975(99)00028-6_bib19","series-title":"ICALP'97, 24th Internat. Colloquium on Automata, Languages, and Programming, Silver Jubilee of EATCS","first-page":"1","article-title":"Inferring big trees from short quartets","volume":"vol. 1256","author":"Erd\u00f6s","year":"1997"},{"key":"10.1016\/S0304-3975(99)00028-6_bib20","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 suffice to build (almost) all trees (I)","volume":"14","author":"Erd\u00f6s","year":"1999","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(99)00028-6_bib21","series-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms","article-title":"Numerical taxonomy on data: experimental results","author":"Farach","year":"1997"},{"key":"10.1016\/S0304-3975(99)00028-6_bib22","series-title":"Proc. ACM Symp. on the Foundations of Computer Science","first-page":"230","article-title":"Efficient algorithms for inverting evolution","author":"Farach","year":"1996"},{"key":"10.1016\/S0304-3975(99)00028-6_bib23","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01188585","article-title":"A robust model for inferring optimal evolutionary trees","volume":"13","author":"Farach","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(99)00028-6_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)00028-6_bib25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.2307\/2412923","article-title":"Cases in which parsimony or compatibility methods will be positively misleading","volume":"27","author":"Felsenstein","year":"1978","journal-title":"Syst. Zool."},{"key":"10.1016\/S0304-3975(99)00028-6_bib26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1086\/412935","article-title":"Numerical methods for inferring evolutionary trees","volume":"57","author":"Felsenstein","year":"1982","journal-title":"Quart. Rev. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib27","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02603120","article-title":"Progressive sequence alignment as a prerequisite to correct phylogenetic trees","volume":"25","author":"Feng","year":"1987","journal-title":"J. Mol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib28","year":"1995"},{"key":"10.1016\/S0304-3975(99)00028-6_bib29","doi-asserted-by":"crossref","first-page":"44","DOI":"10.2307\/1426329","article-title":"The probabilities of rooted tree shapes generated by random bifurcation","volume":"3","author":"Harding","year":"1971","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/S0304-3975(99)00028-6_bib30","first-page":"649","article-title":"A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given","volume":"6","author":"Hein","year":"1989","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2307\/2413480","article-title":"Approaches for assessing phylogenetic accuracy","volume":"44","author":"Hillis","year":"1995","journal-title":"Syst. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib32","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/383130a0","article-title":"Inferring complex phylogenies","volume":"383","author":"Hillis","year":"1996","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(99)00028-6_bib33","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02257378","article-title":"The alignment of sets of sequences and the construction of phylogenetic trees, an integrated method","volume":"20","author":"Hogeweg","year":"1984","journal-title":"J. Mol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib34","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2307\/2413481","article-title":"Performance of phylogenetic methods in simulation","volume":"44","author":"Huelsenbeck","year":"1995","journal-title":"Syst. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib35","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":"Huelsenbeck","year":"1993","journal-title":"Syst. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib36","series-title":"Proc., RECOMB","article-title":"Inferring very large evolutionary trees from very short sequences","author":"Huson","year":"1999"},{"key":"10.1016\/S0304-3975(99)00028-6_bib37","unstructured":"T. Jiang, E. Lawler, L. Wang, Aligning sequences via an evolutionary tree: complexity and approximation ACM STOC'94."},{"key":"10.1016\/S0304-3975(99)00028-6_bib38","unstructured":"S. Kannan, personal communication."},{"key":"10.1016\/S0304-3975(99)00028-6_bib39","first-page":"454","article-title":"Estimation of evolutionary distances between homologous nucleotide sequences","volume":"78","author":"Kimura","year":"1981"},{"key":"10.1016\/S0304-3975(99)00028-6_bib40","series-title":"Statistical Decision Theory and Related Topics","first-page":"1","article-title":"Molecular studies of evolution: a source of novel statistical problems","author":"Neyman","year":"1971"},{"key":"10.1016\/S0304-3975(99)00028-6_bib41","unstructured":"K. Rice, personal communication."},{"key":"10.1016\/S0304-3975(99)00028-6_bib42","series-title":"COCOON'97, Computing and Combinatorics, 3rd Annual Internat. Conf.","first-page":"124","article-title":"Parsimony is hard to beat","volume":"vol. 1276","author":"Rice","year":"1997"},{"key":"10.1016\/S0304-3975(99)00028-6_bib43","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib44","first-page":"514","article-title":"Relative efficiencies of the Fitch-Margoliash, maximum parsimony, maximum likelihood, minimum evolution, and neighbor-joining methods of phylogenetic tree construction in obtaining the correct tree","volume":"6","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib45","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0041-5553(63)90418-X","article-title":"A method for linear recording of graphs","volume":"2","author":"Smolensky","year":"1969","journal-title":"USSR Comput. Math. Phys."},{"key":"10.1016\/S0304-3975(99)00028-6_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"},{"key":"10.1016\/S0304-3975(99)00028-6_bib47","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0893-9659(94)90024-8","article-title":"Recovering a tree from the leaf colourations it generates under a Markov model","volume":"7","author":"Steel","year":"1994","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0304-3975(99)00028-6_bib48","first-page":"367","article-title":"Reconstructing phylogenies from nucleotide pattern probabilities: a survey and some new results","volume":"89","author":"Steel","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00028-6_bib49","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1089\/cmb.1994.1.153","article-title":"Reconstructing trees when sequence sites evolve at variable rates","volume":"1","author":"Steel","year":"1994","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib50","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","article-title":"Quartet Puzzling: a quartet Maximum Likelihood method for reconstructing tree topologies","volume":"13","author":"Strimmer","year":"1996","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib51","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1093\/oxfordjournals.molbev.a025756","article-title":"Bayesian probabilities and Quartet Puzzling","volume":"14","author":"Strimmer","year":"1997","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib52","series-title":"Molecular Systematics","first-page":"407","article-title":"Phylogenetic inference","author":"Swofford","year":"1996"},{"key":"10.1016\/S0304-3975(99)00028-6_bib53","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00028-6_bib54","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/BF00163810","article-title":"Inconsistency of the maximum parsimony method when the rate of nucleotide substitution is constant","volume":"39","author":"Takezaki","year":"1994","journal-title":"J. Mol. Evol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib55","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1126\/science.3018931","article-title":"Nuclear and mitochondrial DNA comparisons reveal extreme rate variation in the molecular clock","volume":"234","author":"Vawter","year":"1986","journal-title":"Science"},{"key":"10.1016\/S0304-3975(99)00028-6_bib56","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1093\/genetics\/134.2.597","article-title":"Rates and patterns of base change in the small subunit ribosomal RNA gene","volume":"134","author":"Vawter","year":"1993","journal-title":"Genetics"},{"key":"10.1016\/S0304-3975(99)00028-6_bib57","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jagm.1997.0882","article-title":"Improved approximation algorithms for tree alignment","volume":"25","author":"Wang","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00028-6_bib58","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","article-title":"On the complexity of multiple sequence alignment","volume":"1","author":"Wang","year":"1994","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib59","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01955679","article-title":"Approximation algorithms for tree alignment with a given phylogeny","volume":"16","author":"Wang","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(99)00028-6_bib60","series-title":"Proc. 1st Annual Internat. Conf. on Computational Molecular Biology","article-title":"A more efficient approximation scheme for tree alignment","author":"Wang","year":"1997"},{"key":"10.1016\/S0304-3975(99)00028-6_bib61","article-title":"Combinatorial algorithms for constructing phylogenetic trees","author":"Warnow","year":"1991"},{"key":"10.1016\/S0304-3975(99)00028-6_bib62","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0022-5193(77)90351-4","article-title":"Additive evolutionary trees","volume":"64","author":"Waterman","year":"1977","journal-title":"J. Theoret. Biol."},{"key":"10.1016\/S0304-3975(99)00028-6_bib63","first-page":"68","article-title":"The recent African genesis of humans","volume":"266","author":"Wilson","year":"1992","journal-title":"Scientific Amer."},{"key":"10.1016\/S0304-3975(99)00028-6_bib64","first-page":"90","article-title":"Reconstruction of a tree from the distances between its pendant vertices","volume":"20","author":"Zaretsky","year":"1965","journal-title":"Uspekhi Math. Nauk"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000286?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000286?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T15:11:26Z","timestamp":1778685086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":64,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000286"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00028-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A few logs suffice to build (almost) all trees: Part II","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(99)00028-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}