{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:28:00Z","timestamp":1725593280143},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_14","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"147-161","source":"Crossref","is-referenced-by-count":4,"title":["Fast Error-Tolerant Quartet Phylogeny Algorithms"],"prefix":"10.1007","author":[{"given":"Daniel G.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Truszkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1093\/nar\/30.1.276","volume":"30","author":"A. Bateman","year":"2002","unstructured":"Bateman, A., Birney, E., Cerruti, L., Durbin, R., Etwiller, L., Eddy, S.R., Griffiths-Jones, S., Howe, K.L., Marshall, M., Sonnhammer, E.L.L.: The Pfam protein families database. Nucleic Acids Research\u00a030(1), 276\u2013280 (2002)","journal-title":"Nucleic Acids Research"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-48481-7_28","volume-title":"Algorithms - ESA\u201999","author":"V. Berry","year":"1999","unstructured":"Berry, V., Jiang, T., Kearney, P.E., Li, M., Wareham, H.T.: Quartet cleaning: Improved algorithms and simulations. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 313\u2013324. Springer, Heidelberg (1999)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00453-003-1065-y","volume":"38","author":"G. Brodal","year":"2003","unstructured":"Brodal, G., Fagerberg, R., Pedersen, C.: Computing the quartet distance between evolutionary trees in time O(n log n). Algorithmica\u00a038, 377\u2013395 (2003)","journal-title":"Algorithmica"},{"key":"14_CR4","unstructured":"Bryant, D., Tsang, J., Kearney, P.E., Li, M.: Computing the quartet distance between evolutionary trees. In: Proceedings of SODA 2000, pp. 285\u2013286 (2000)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1089\/10665270252935467","volume":"9","author":"M. Cs\u0171r\u00f6s","year":"2002","unstructured":"Cs\u0171r\u00f6s, M.: Fast recovery of evolutionary trees with thousands of nodes. J. Comp. Biol.\u00a09(2), 277\u2013297 (2002)","journal-title":"J. Comp. Biol."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-02008-7_32","volume-title":"Research in Computational Molecular Biology","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Mossel, E., Roch, S.: Phylogenies without branch bounds: Contracting the short, pruning the deep. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 451\u2013465. Springer, Heidelberg (2009)"},{"key":"14_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of measure for the analysis of randomized algorithms","author":"D.P. Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of measure for the analysis of randomized algorithms. Cambridge Univ. Press, Cambridge (2009)"},{"issue":"1-2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0304-3975(99)00028-6","volume":"221","author":"P.L. Erd\u00f6s","year":"1999","unstructured":"Erd\u00f6s, P.L., Steel, M.A., Sz\u00e9kely, L.A., Warnow, T.: A few logs suffice to build (almost) all trees: Part II. Theor. Comput. Sci.\u00a0221(1-2), 77\u2013118 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Computing with unreliable information. In: Proceedings of STOC 1990, pp. 128\u2013137.","DOI":"10.1145\/100216.100230"},{"key":"14_CR10","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer (2001)"},{"key":"14_CR11","unstructured":"Gronau, I., Moran, S., Snir, S.: Fast and reliable reconstruction of phylogenetic trees with very short edges. In: Proceedings of SODA 2008, pp. 379\u2013388 (2008)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, T., Kearney, P., Li, M.: Orchestrating quartets: Approximation and data correction. In: Proceedings of FOCS 1998, pp. 416\u2013425 (1998)","DOI":"10.1109\/SFCS.1998.743492"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"S.K. Kannan","year":"1996","unstructured":"Kannan, S.K., Lawler, E.L., Warnow, T.J.: Determining the evolutionary tree using experiments. J. Algorithms\u00a021(1), 26\u201350 (1996)","journal-title":"J. Algorithms"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-49116-3_17","volume-title":"STACS 99","author":"M.Y. Kao","year":"1999","unstructured":"Kao, M.Y., Lingas, A., \u00d6stlin, A.: Balanced randomized tree splitting with applications to evolutionary tree constructions. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 184\u2013196. Springer, Heidelberg (1999)"},{"key":"14_CR15","unstructured":"Karp, R.M., Kleinberg, R.: Noisy binary search and its applications. In: Proceedings of SODA 2007, pp. 881\u2013890 (2007)"},{"key":"14_CR16","unstructured":"King, V., Zhang, L., Zhou, Y.: On the complexity of distance-based evolutionary tree reconstruction. In: Proceedings of SODA 2003, pp. 444\u2013453 (2003)"},{"issue":"7","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1093\/molbev\/msp077","volume":"26","author":"M.N. Price","year":"2009","unstructured":"Price, M.N., Dehal, P.S., Arkin, A.P.: FastTree: Computing large minimum evolution trees with profiles instead of a distance matrix. Molecular Biology and Evolution\u00a026(7), 1641\u20131650 (2009)","journal-title":"Molecular Biology and Evolution"},{"issue":"6","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1093\/oxfordjournals.molbev.a003881","volume":"18","author":"V. Ranwez","year":"2001","unstructured":"Ranwez, V., Gascuel, O.: Quartet-based phylogenetic inference: Improvements and limits. Molecular Biology and Evolution\u00a018(6), 1103\u20131116 (2001)","journal-title":"Molecular Biology and Evolution"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1089\/cmb.2007.0103","volume":"15","author":"S. Snir","year":"2008","unstructured":"Snir, S., Warnow, T., Rao, S.: Short quartet puzzling: A new quartet-based phylogeny reconstruction algorithm. Journal of Computational Biology\u00a015(1), 91\u2013103 (2008)","journal-title":"Journal of Computational Biology"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1186\/1471-2105-6-108","volume":"6","author":"E.L.L. Sonnhammer","year":"2005","unstructured":"Sonnhammer, E.L.L., Hollich, V.: Scoredist: A simple and robust protein sequence distance estimator. BMC Bioinformatics\u00a06, 108 (2005)","journal-title":"BMC Bioinformatics"},{"issue":"7","key":"14_CR21","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. Mol. Biol. E\u00a013(7), 964\u2013969 (1996)","journal-title":"Mol. Biol. E"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Wu, G., Kao, M.Y., Lin, G., You, J.H.: Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability. Alg. Mol. Biol.\u00a03 (2008)","DOI":"10.1186\/1748-7188-3-1"},{"issue":"1","key":"14_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TCBB.2007.1008","volume":"4","author":"G. Wu","year":"2007","unstructured":"Wu, G., You, J.H., Lin, G.: Quartet-based phylogeny reconstruction with answer set programming. IEEE\/ACM Trans. Comput. Biol. Bioinf.\u00a04(1), 139\u2013152 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T12:04:52Z","timestamp":1560341092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}