{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:07:02Z","timestamp":1742393222086},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_43","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"472-483","source":"Crossref","is-referenced-by-count":4,"title":["Constructing the Simplest Possible Phylogenetic Network from Triplets"],"prefix":"10.1007","author":[{"given":"Leo","family":"van Iersel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"43_CR1","doi-asserted-by":"publisher","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 Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR2","doi-asserted-by":"publisher","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. Mathematical Biology\u00a051, 171\u2013182 (2005)","journal-title":"Mathematical Biology"},{"key":"43_CR3","doi-asserted-by":"publisher","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. Annals of Combinatorics\u00a08, 391\u2013408 (2004)","journal-title":"Annals of Combinatorics"},{"issue":"8","key":"43_CR4","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0155(8), 914\u2013928 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"43_CR5","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0335(1), 93\u2013107 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"43_CR6","doi-asserted-by":"publisher","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. Journal of Bioinformatics and Computational Biology\u00a02(1), 173\u2013213 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"issue":"1","key":"43_CR7","doi-asserted-by":"publisher","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. Journal of Bioinformatics and Computational Biology\u00a04(1), 59\u201374 (2006)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"43_CR8","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, 185\u2013200 (1990)","journal-title":"Mathematical Biosciences"},{"issue":"2","key":"43_CR9","doi-asserted-by":"publisher","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. Molecular Biology and Evolution\u00a023(2), 254\u2013267 (2006)","journal-title":"Molecular Biology and Evolution"},{"key":"43_CR10","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11415770_20","volume-title":"Research in Computational Molecular Biology","author":"T.N.D. Huynh","year":"2005","unstructured":"Huynh, T.N.D., Jansson, J., Nguyen, N.B., Sung, W.-K.: Constructing a Smallest Refining Galled Phylogenetic Network. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 265\u2013280. Springer, Heidelberg (2005)"},{"key":"43_CR11","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-78839-3_40","volume-title":"Research in Computational Molecular Biology","author":"L.J.J. Iersel van","year":"2008","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: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol.\u00a04955, pp. 450\u2013462. Springer, Heidelberg (2008)"},{"key":"43_CR12","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":"43_CR13","doi-asserted-by":"publisher","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 Journal on Computing\u00a035(5), 1098\u20131121 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR14","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0363, 60\u201368 (2006)","journal-title":"Theoretical Computer Science"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Makarenkov, V., Kevorkov, D., Legendre, P.: Phylogenetic Network Reconstruction Approaches. In: Applied Mycology and Biotechnology. International Elsevier Series 6, Bioinformatics, pp. 61\u201397 (2006)","DOI":"10.1016\/S1874-5334(06)80006-7"},{"key":"43_CR16","unstructured":"MARLON: Constructing Level One Phylogenetic Networks with a Minimum Amount of Reticulation, http:\/\/homepages.cwi.nl\/~kelk\/marlon.html"},{"issue":"5","key":"43_CR17","doi-asserted-by":"publisher","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. International Journal for Parasitology\u00a035(5), 567\u2013582 (2005)","journal-title":"International Journal for Parasitology"},{"issue":"1","key":"43_CR18","doi-asserted-by":"publisher","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 Transactions on Computational Biology and Bioinformatics\u00a01(1), 13\u201323 (2004)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"43_CR19","doi-asserted-by":"publisher","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. Journal of Mathematical Biology\u00a048, 160\u2013186 (2004)","journal-title":"Journal of Mathematical Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T03:44:31Z","timestamp":1557978271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}