{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:51:47Z","timestamp":1781077907942,"version":"3.54.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,24]],"date-time":"2008-01-24T00:00:00Z","timestamp":1201132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1186\/1748-7188-3-1","type":"journal-article","created":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T19:19:48Z","timestamp":1201288788000},"source":"Crossref","is-referenced-by-count":6,"title":["Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability"],"prefix":"10.1186","volume":"3","author":[{"given":"Gang","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming-Yang","family":"Kao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,1,24]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/S009753970037905X","volume":"31","author":"M Cs\u0171r\u00f6s","year":"2001","unstructured":"Cs\u0171r\u00f6s M, Kao MY: Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets. SIAM Journal on Computing. 2001, 31: 306-322.","journal-title":"SIAM Journal on Computing"},{"key":"42_CR2","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou N, Nei M: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution. 1987, 4: 406-425.","journal-title":"Molecular Biology and Evolution"},{"issue":"7","key":"42_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/MC.2002.1016902","volume":"35","author":"BME Moret","year":"2002","unstructured":"Moret BME, Wang LS, Warnow T: Toward new software for computational phylogenetics. IEEE Computer. 2002, 35 (7): 55-64.","journal-title":"IEEE Computer"},{"key":"42_CR4","volume-title":"Master's thesis","author":"D Pelleg","year":"1998","unstructured":"Pelleg D: Algorithms for constructing phylogenies from quartets. Master's thesis. 1998, Israel Institute of Technology"},{"key":"42_CR5","first-page":"9","volume-title":"Proceedings of the 2nd Annual International Conference on Computational Molecular Biology","author":"A Ben-Dor","year":"1998","unstructured":"Ben-Dor A, Chor B, Graur D, Ophir R, Pelleg D: From four-taxon trees to phylogenies (preliminary report): The Case of Mammalian Evolution. Proceedings of the 2nd Annual International Conference on Computational Molecular Biology. 1998, 9-19."},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1126\/science.155.3760.279","volume":"155","author":"WM Fitch","year":"1967","unstructured":"Fitch WM, Margoliash E: Construction of phylogenetic trees. Science. 1967, 155: 279-284.","journal-title":"Science"},{"key":"42_CR7","first-page":"125","volume-title":"Proceedings of the 2nd Annual International Conference on Computational Molecular Biology","author":"PE Kearney","year":"1998","unstructured":"Kearney PE: The ordinal quartet method. Proceedings of the 2nd Annual International Conference on Computational Molecular Biology. 1998, 125-134."},{"key":"42_CR8","first-page":"827","volume-title":"Lecture Notes in Computer Science 1256: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming","author":"PL Erd\u0151s","year":"1997","unstructured":"Erd\u0151s PL, Steel M, Sz\u00e9k\u00e9ly L, Warnow T: Constructing big trees from short sequences. Lecture Notes in Computer Science 1256: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming. Edited by: Goos G, Hartmanis J, van Leeuwen J. 1997, 827-837. New York, NY: Springer-Verlag"},{"key":"42_CR9","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":"PL Erd\u0151s","year":"1997","unstructured":"Erd\u0151s PL, Steel MA, Sz\u00e9kely LA, Warnow T: A few logs suffice to build (almost) all trees I. Random Structures and Algorithms. 1997, 14: 153-184.","journal-title":"Random Structures and Algorithms"},{"issue":"7","key":"42_CR10","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K Strimmer","year":"1996","unstructured":"Strimmer K, von Haeseler A: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution. 1996, 13 (7): 964-969.","journal-title":"Molecular Biology and Evolution"},{"key":"42_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511802843","volume-title":"Bootstrap Methods and Their Applications","author":"AC Davison","year":"1997","unstructured":"Davison AC, Hinkley DV:: Bootstrap Methods and Their Applications. 1997, Cambridge, U.K.: Cambridge University Press"},{"key":"42_CR12","first-page":"407","volume-title":"Molecular Systematics","author":"DL Swofford","year":"1996","unstructured":"Swofford DL, Olsen GJ, Waddell PJ, Hillis DM: Phylogenetic Inference. Molecular Systematics. Edited by: Hillis DM, Moritz C, Mable BK. 1996, 407-514. Sunderland, MA: Sinauer Associates, 2","edition":"2"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jagm.1999.1050","volume":"34","author":"T Jiang","year":"2000","unstructured":"Jiang T, Kearney P, Li M: Some open problems in computational molecular biology. Journal of Algorithms. 2000, 34: 194-201.","journal-title":"Journal of Algorithms"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/S0022-0000(03)00077-1","volume":"67","author":"J Gramm","year":"2003","unstructured":"Gramm J, Niedermeier R: A fixed-parameter algorithm for minimum quartet inconsistency. Journal of Computer and System Sciences. 2003, 67: 723-741.","journal-title":"Journal of Computer and System Sciences"},{"key":"42_CR15","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1109\/ICTAI.2004.103","volume-title":"Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence","author":"G Wu","year":"2004","unstructured":"Wu G, Lin G, You J: Quartet based phylogeny reconstruction with answer set programming. Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence. 2004, 612-619."},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T Jiang","year":"2000","unstructured":"Jiang T, Kearney P, Li M: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM Journal on Computing. 2000, 30: 1942-1961.","journal-title":"SIAM Journal on Computing"},{"key":"42_CR17","first-page":"894","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"GD Vedova","year":"2002","unstructured":"Vedova GD, Jiang T, Li J, Wen J: Approximating minimum quartet inconsistency (abstract). Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 2002, 894-895."},{"key":"42_CR18","first-page":"287","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"V Berry","year":"2000","unstructured":"Berry V, Bryant D, Jiang T, Kearney P, Li M, Wareham T, Zhang H: A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 2000, 287-296."},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1515\/crll.1869.70.185","volume":"70","author":"C Jordan","year":"1869","unstructured":"Jordan C: Sur les assemblages de lignes. Journal f\u00fcr die Reine und Angewandte Mathematik. 1869, 70: 185-190.","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"SK Kannan","year":"1996","unstructured":"Kannan SK, Lawler EL, Warnow T: Determining the evolutionary tree using experiments. Journal of Algorithms. 1996, 21: 26-50.","journal-title":"Journal of Algorithms"},{"key":"42_CR21","first-page":"184","volume-title":"Lecture Notes in Computer Science 1563: Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science","author":"MY Kao","year":"1999","unstructured":"Kao MY, Lingas A, \u00d6stlin A: Balanced randomized tree splitting with applications to evolutionary tree constructions. Lecture Notes in Computer Science 1563: Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science. Edited by: Meinel C, Tison S. 1999, 184-196. New York, NY: Springer-Verlag"},{"key":"42_CR22","first-page":"140","volume-title":"Lecture Notes in Computer Science 2076: Proceedings of the 28th International Colloquium on Automata, Languages, and Programming","author":"GS Brodal","year":"2001","unstructured":"Brodal GS, Fagerberg R, Pedersen CNS, \u00d6stlin A: The complexity of constructing evolutionary trees using experiments. Lecture Notes in Computer Science 2076: Proceedings of the 28th International Colloquium on Automata, Languages, and Programming. Edited by: Orejas F, Spirakis PG, van Leeuwen J. 2001, 140-151. New York, NY: Springer-Verlag"},{"key":"42_CR23","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/B978-1-4832-3211-9.50009-7","volume-title":"Mammalian Protein Metabolism","author":"TH Jukes","year":"1969","unstructured":"Jukes TH, Cantor CR: Evolution of protein molecules. Mammalian Protein Metabolism. Edited by: Munro HN. 1969, III: 21-132. New York, NY: Academic Press"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-3-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-3-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-3-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:32:11Z","timestamp":1548113531000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-3-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,24]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-3-1","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,24]]},"article-number":"1"}}