{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T13:14:20Z","timestamp":1789391660769,"version":"build-2803163510"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00453-009-9333-0","type":"journal-article","created":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T14:45:11Z","timestamp":1246891511000},"page":"207-235","source":"Crossref","is-referenced-by-count":36,"title":["Constructing the Simplest Possible Phylogenetic Network from Triplets"],"prefix":"10.1007","volume":"60","author":[{"given":"Leo","family":"van Iersel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,7,7]]},"reference":[{"issue":"3","key":"9333_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A.V. Aho","year":"1981","unstructured":"Aho, A.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 J. Comput. 10(3), 405\u2013421 (1981)","journal-title":"SIAM J. Comput."},{"key":"9333_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s00026-004-0228-0","volume":"8","author":"M. Baroni","year":"2004","unstructured":"Baroni, M., Semple, C., Steel, M.: A framework for representing reticulate evolution. Ann. Comb. 8, 391\u2013408 (2004)","journal-title":"Ann. Comb."},{"key":"9333_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M. Baroni","year":"2005","unstructured":"Baroni, M., Gr\u00fcnewald, S., Moulton, V., Semple, C.: Bounding the number of hybridisation events for a consistent evolutionary history. Math. Biol. 51, 171\u2013182 (2005)","journal-title":"Math. Biol."},{"issue":"8","key":"9333_CR4","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.dam.2006.08.008","volume":"155","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl. Math. 155(8), 914\u2013928 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9333_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1177\/117693430700300017","volume":"3","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Linz, S., John, K.\u00a0St., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform. 3, 86\u201398 (2007)","journal-title":"Evol. Bioinform."},{"key":"9333_CR6","unstructured":"Byrka, J., Gawrychowski, P., Kelk, S.M., Huber, K.T.: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. arXiv:0710.3258v3 [q-bio.PE] (2008)"},{"issue":"1","key":"9333_CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.tcs.2004.12.012","volume":"335","author":"C. Choy","year":"2005","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1), 93\u2013107 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9333_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0219720004000521","volume":"2","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstructing of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2(1), 173\u2013213 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"6\u20137","key":"9333_CR9","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.dam.2005.05.044","volume":"155","author":"D. Gusfield","year":"2007","unstructured":"Gusfield, D., Hickerson, D., Eddhu, S.: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study. Discrete Appl. Math. 155(6\u20137), 806\u2013830 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9333_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0219720006001709","volume":"4","author":"Y.-J. He","year":"2006","unstructured":"He, Y.-J., Huynh, T.N.D., Jansson, J., Sung, W.-K.: Inferring phylogenetic relationships avoiding forbidden rooted triplets. J. Bioinform. Comput. Biol. 4(1), 59\u201374 (2006)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"1","key":"9333_CR11","doi-asserted-by":"crossref","first-page":"113","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 24(1), 113 (1999)","journal-title":"Algorithmica"},{"issue":"2","key":"9333_CR12","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1093\/molbev\/msj030","volume":"23","author":"D.H. Huson","year":"2006","unstructured":"Huson, D.H., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Mol. Biol. Evol. 23(2), 254\u2013267 (2006)","journal-title":"Mol. Biol. Evol."},{"key":"9333_CR13","doi-asserted-by":"crossref","unstructured":"Huynh, T.N.D., Jansson, J., Nguyen, N.B., Sung, W.-K.: Constructing a smallest refining galled phylogenetic network. In: Proceedings of Research in Computational Molecular Biology (RECOMB 2005). LNCS, vol. 3500, pp. 265\u2013280 (2005)","DOI":"10.1007\/11415770_20"},{"key":"9333_CR14","doi-asserted-by":"crossref","unstructured":"van Iersel, L.J.J., Keijsper, J.C.M., Kelk, S.M., Stougie, L.: Constructing level-2 phylogenetic networks from triplets. arXiv:0707.2890v1 [p-bio.PE] (2007)","DOI":"10.1007\/978-3-540-78839-3_40"},{"key":"9333_CR15","doi-asserted-by":"crossref","unstructured":"van Iersel, L.J.J., Keijsper, J.C.M., Kelk, S.M., Stougie, L., Hagen, F., Boekhout, T.: Constructing level-2 phylogenetic networks from triplets. In: Proceedings of Research in Computational Molecular Biology (RECOMB 2008). LNBI, vol. 4955, pp. 450\u2013462 (2008)","DOI":"10.1007\/978-3-540-78839-3_40"},{"key":"9333_CR16","unstructured":"van Iersel, L.J.J., Kelk, S.M., Mnich, M.: Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks. arXiv:0712.2932v3 [q-bio.PE] (2008)"},{"issue":"5","key":"9333_CR17","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1137\/S0097539704446529","volume":"35","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM J. Comput. 35(5), 1098\u20131121 (2006)","journal-title":"SIAM J. Comput."},{"key":"9333_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.tcs.2006.06.022","volume":"363","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Sung, W.-K.: Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comput. Sci. 363, 60\u201368 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9333_CR19","series-title":"Bioinformatics","first-page":"61","volume-title":"Applied Mycology and Biotechnology","author":"V. Makarenkov","year":"2006","unstructured":"Makarenkov, V., Kevorkov, D., Legendre, P.: Phylogenetic network reconstruction approaches. In: Applied Mycology and Biotechnology. Bioinformatics, vol. 6, pp. 61\u201397. Elsevier, Amsterdam (2006)"},{"key":"9333_CR20","unstructured":"MARLON: constructing level one phylogenetic networks with a minimum amount of reticulation. http:\/\/homepages.cwi.nl\/~kelk\/marlon.html"},{"issue":"5","key":"9333_CR21","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/j.ijpara.2005.02.007","volume":"35","author":"D.A. Morrison","year":"2005","unstructured":"Morrison, D.A.: Networks in phylogenetic analysis: new tools for population biology. Int. J. Parasitol. 35(5), 567\u2013582 (2005)","journal-title":"Int. J. Parasitol."},{"issue":"1","key":"9333_CR22","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TCBB.2004.10","volume":"1","author":"B.M.E. Moret","year":"2004","unstructured":"Moret, B.M.E., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R.: Phylogenetic networks: modeling, reconstructibility, and accuracy. IEEE\/ACM Trans. Comput. Biol. Bioinform. 1(1), 13\u201323 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"9333_CR23","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/s00285-003-0227-5","volume":"48","author":"Y.S. Song","year":"2004","unstructured":"Song, Y.S., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. J. Math. Biol. 48, 160\u2013186 (2004)","journal-title":"J. Math. Biol."},{"issue":"1","key":"9333_CR24","doi-asserted-by":"crossref","first-page":"i413","DOI":"10.1093\/bioinformatics\/bti1033","volume":"21","author":"Y.S. Song","year":"2005","unstructured":"Song, Y.S., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. Bioinformatics 21(1), i413\u2013i422 (2005)","journal-title":"Bioinformatics"},{"issue":"1","key":"9333_CR25","doi-asserted-by":"crossref","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. J. Comput. Biol. 8(1), 69\u201378 (2001)","journal-title":"J. Comput. Biol."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9333-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:45:52Z","timestamp":1558424752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9333-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,7]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9333"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9333-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,7]]}}}