{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:04:30Z","timestamp":1742378670953},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_49","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"462-471","source":"Crossref","is-referenced-by-count":10,"title":["Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"49_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"V. Aho","year":"1981","unstructured":"Aho, V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR2","unstructured":"Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis. PhD thesis, University of Canterbury, Christchurch, New Zealand (1997)"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-44696-6_16","volume-title":"Algorithms in Bioinformatics","author":"B. Chor","year":"2001","unstructured":"Chor, B., Hendy, M., Penny, D.: Analytic solutions for three-taxon MLMC trees with variable rates across sites. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 204\u2013213. Springer, Heidelberg (2001)"},{"key":"49_CR4","first-page":"33","volume-title":"Proc. of Computing: the 10th Australasian Theory Symposium (CATS 2004)","author":"C. Choy","year":"2004","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the maximum agreement of phylogenetic networks. In: Proc. of Computing: the 10th Australasian Theory Symposium (CATS 2004), pp. 33\u201345. Elsevier, Amsterdam (2004)"},{"key":"49_CR5","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Massachusetts (1990)"},{"key":"49_CR6","series-title":"Australian Computer Science Communications","first-page":"67","volume-title":"Proc. of Computing: the 4th Australasian Theory Symposium (CATS 1998)","author":"L. Ga\u0327sieniec","year":"1998","unstructured":"Ga\u0327sieniec, L., Jansson, J., Lingas, A., \u00d6stlin, A.: Inferring ordered trees from local constraints. In: Proc. of Computing: the 4th Australasian Theory Symposium (CATS 1998). Australian Computer Science Communications, vol.\u00a020(3), pp. 67\u201376. Springer, Singapore (1998)"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1009833626004","volume":"3","author":"L. Ga\u0327sieniec","year":"1999","unstructured":"Ga\u0327sieniec, L., Jansson, J., Lingas, A., \u00d6stlin, A.: On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization\u00a03, 183\u2013197 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proc. of the Computational Systems Bioinformatics Conference (CSB 2003), pp. 363\u2013374 (2003)","DOI":"10.1109\/CSB.2003.1227337"},{"issue":"2","key":"49_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0025-5564(90)90123-G","volume":"98","author":"J. Hein","year":"1990","unstructured":"Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Mathematical Biosciences\u00a098(2), 185\u2013200 (1990)","journal-title":"Mathematical Biosciences"},{"issue":"1","key":"49_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica\u00a024(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"issue":"4","key":"49_CR11","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM\u00a048(4), 723\u2013760 (2001)","journal-title":"Journal of the ACM"},{"key":"49_CR12","series-title":"Electronic Notes in Discrete Mathematics","first-page":"121","volume-title":"Proc. of the Brazilian Symp. on Graphs, Algorithms, and Combinatorics (GRACO 2001)","author":"J. Jansson","year":"2001","unstructured":"Jansson, J.: On the complexity of inferring rooted evolutionary trees. In: Proc. of the Brazilian Symp. on Graphs, Algorithms, and Combinatorics (GRACO 2001). Electronic Notes in Discrete Mathematics, vol.\u00a07, pp. 121\u2013125. Elsevier, Amsterdam (2001)"},{"key":"49_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-540-24698-5_53","volume-title":"LATIN 2004: Theoretical Informatics","author":"J. Jansson","year":"2004","unstructured":"Jansson, J., Ng, J.H.-K., Sadakane, K., Sung, W.-K.: Rooted maximum agreement supertrees. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 499\u2013508. Springer, Heidelberg (2004)"},{"issue":"6","key":"49_CR14","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T. Jiang","year":"2001","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\u00a030(6), 1942\u20131961 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"49_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"S. Kannan","year":"1996","unstructured":"Kannan, S., Lawler, E., Warnow, T.: Determining the evolutionary tree using experiments. Journal of Algorithms\u00a021(1), 26\u201350 (1996)","journal-title":"Journal of Algorithms"},{"key":"49_CR16","first-page":"111","volume-title":"Current Topics in Computational Molecular Biology","author":"P. Kearney","year":"2002","unstructured":"Kearney, P.: Phylogenetics and the quartet method. In: Jiang, T., Xu, Y., Zhang, M.Q. (eds.) Current Topics in Computational Molecular Biology, pp. 111\u2013133. The MIT Press, Massachusetts (2002)"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R.: Reconstructing reticulate evolution in species \u2013 theory and practice. In: Proc. of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004) (to appear)","DOI":"10.1089\/cmb.2005.12.796"},{"issue":"1","key":"49_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0169-5347(00)02026-7","volume":"16","author":"D. Posada","year":"2001","unstructured":"Posada, D., Crandall, K.A.: Intraspecific gene genealogies: trees grafting into networks. TRENDS in Ecology & Evolution\u00a016(1), 37\u201345 (2001)","journal-title":"TRENDS in Ecology & Evolution"},{"issue":"1","key":"49_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification\u00a09(1), 91\u2013116 (1992)","journal-title":"Journal of Classification"},{"issue":"1","key":"49_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1089\/106652701300099119","volume":"8","author":"L. Wang","year":"2001","unstructured":"Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. Journal of Computational Biology\u00a08(1), 69\u201378 (2001)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:41Z","timestamp":1620012401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}