{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:16:02Z","timestamp":1725484562070},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425168"},{"type":"electronic","value":"9783540446965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44696-6_17","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T03:45:10Z","timestamp":1180669510000},"page":"214-226","source":"Crossref","is-referenced-by-count":2,"title":["The Performance of Phylogenetic Methods on Trees of Bounded Diameter"],"prefix":"10.1007","author":[{"given":"Luay","family":"Nakhleh","sequence":"first","affiliation":[]},{"given":"Usman","family":"Roshan","sequence":"additional","affiliation":[]},{"given":"Katherine St.","family":"John","sequence":"additional","affiliation":[]},{"given":"Jerry","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/PL00008277","volume":"25","author":"K. Atteson","year":"1999","unstructured":"K. Atteson. The performance of the neighbor-joining methods of phylogenetic reconstruction. Algorithmica, 25:251\u2013278, 1999.","journal-title":"Algorithmica"},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0045078","volume-title":"Proc. 3rd Ann. Int\u2019l Conf. Computing and Combinatorics (COCOON 97)","author":"V. Berry","year":"1997","unstructured":"V. Berry and O. Gascuel. Inferring evolutionary trees with strong combinatorial evidence. In Proc. 3rd Ann. Int\u2019l Conf. Computing and Combinatorics (COCOON 97), pages 111\u2013123. Springer Verlag, 1997. in LNCS 1276."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"M. Cs\u0171r\u00f6s. Fast recovery of evolutionary trees with thousands of nodes. To appear in RECOMB 01, 2001.","DOI":"10.1145\/369133.369178"},{"key":"17_CR4","unstructured":"M. Cs\u0171r\u00f6s and M. Y. Kao. Recovering evolutionary trees through harmonic greedy triplets. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 99), pages 261\u2013270, 1999."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","volume":"14","author":"P. L. Erdos","year":"1997","unstructured":"P. L. Erdos, M. Steel, L. Sz\u00e9k\u00e9ly, and T. Warnow. A few logs suffice to build almost all trees-I. Random Structures and Algorithms, 14:153\u2013184, 1997.","journal-title":"Random Structures and Algorithms"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0304-3975(99)00028-6","volume":"221","author":"P. L. Erdos","year":"1999","unstructured":"P. L. Erdos, M. Steel, L. Sz\u00e9k\u00e9ly, and T. Warnow. A few logs suffice to build almost all trees-II. Theor. Comp. Sci., 221:77\u2013118, 1999.","journal-title":"Theor. Comp. Sci."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2307\/2992463","volume":"42","author":"J. Huelsenbeck","year":"1993","unstructured":"J. Huelsenbeck and D. Hillis. Success of phylogenetic methods in the four-taxon case. Syst. Biol., 42:247\u2013264, 1993.","journal-title":"Syst. Biol."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1089\/106652799318337","volume":"6","author":"D. Huson","year":"1999","unstructured":"D. Huson, S. Nettles, and T. Warnow. Disk-covering, a fast-converging method for phylogenetic tree reconstruction. Comput. Biol., 6:369\u2013386, 1999.","journal-title":"Comput. Biol."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"D. Huson, K. A. Smith, and T. Warnow. Correcting large distances for phylogenetic reconstruction. In Proceedings of the 3rd Workshop on Algorithms Engineering (WAE), 1999. London, England.","DOI":"10.1007\/3-540-48318-7_22"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01731581","volume":"16","author":"M. Kimura","year":"1980","unstructured":"M. Kimura. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J. Mol. Evol., 16:111\u2013120, 1980.","journal-title":"J. Mol. Evol."},{"key":"17_CR11","unstructured":"W.H. Li. Molecular Evolution. Sinauer, Massachuesetts, 1997."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/130844.130853","volume":"24","author":"C. McGeoch","year":"1992","unstructured":"C. McGeoch. Analyzing algorithms by simulation: variance reduction techniques and simulation speedups. ACM Comp. Surveys, 24:195\u2013212, 1992.","journal-title":"ACM Comp. Surveys"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"B. Moret. Towards a discipline of experimental algorithmics, 2001. To appear in Monograph in Discrete Mathematics and Theoretical Computer Science; Also see http:\/\/www.cs.unm.edu\/moret\/dimacs.ps .","DOI":"10.1090\/dimacs\/059\/10"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"L. Nakhleh, U. Roshan, K St. John, J. Sun, and T. Warnow. Designing fast converging phylogenetic methods. Oxford U. Press, 2001. To appear in Bioinformatics: Proc. 9th Int\u2019l Conf. on Intelligent Systems for Mol. Biol. (ISMB 01).","DOI":"10.1093\/bioinformatics\/17.suppl_1.S190"},{"key":"17_CR15","first-page":"235","volume":"13","author":"A. Rambaut","year":"1997","unstructured":"A. Rambaut and N. C. Grassly. Seq-gen: An application for the Monte Carlo simulation of dna sequence evolution along phylogenetic trees. Comp. Appl. Biosci., 13:235\u2013238, 1997.","journal-title":"Comp. Appl. Biosci."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D. F. Robinson","year":"1981","unstructured":"D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53:131\u2013147, 1981.","journal-title":"Mathematical Biosciences"},{"key":"17_CR17","unstructured":"M. Sanderson. r8s software package. Available from http:\/\/loco.ucdavis.edu\/r8s\/r8s.html ."},{"key":"17_CR18","first-page":"406","volume":"4","author":"N. Sautou","year":"1987","unstructured":"N. Sautou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4:406\u2013425, 1987.","journal-title":"Mol. Biol. Evol."},{"key":"17_CR19","volume-title":"PAUP*: Phylogenetic analysis using parsimony (and other methods)","author":"D. L. Swofford","year":"1996","unstructured":"D. L. Swofford. PAUP*: Phylogenetic analysis using parsimony (and other methods), 1996. Sinauer Associates, Underland, Massachusetts, Version 4.0."},{"key":"17_CR20","unstructured":"Condor Development Team. Condor high throughput computing program, Copyright 1990\u20132001. Developed at the Computer Sciences Department of the University of Wisconsin; http:\/\/www.cs.wisc.edu\/condor ."},{"key":"17_CR21","unstructured":"T. Warnow, B. Moret, and K. St. John. Absolute convergence: true trees from short sequences. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 01), pages 186\u2013195, 2001."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44696-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T03:46:05Z","timestamp":1683863165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44696-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425168","9783540446965"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44696-6_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}