{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:42Z","timestamp":1759063842648,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T00:00:00Z","timestamp":1442188800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Netherlands Organization for Scientific Research (NWO)","award":["639.071.106"],"award-info":[{"award-number":["639.071.106"]}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["ANR-10-BINF-01-02"],"award-info":[{"award-number":["ANR-10-BINF-01-02"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00453-015-0069-8","type":"journal-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T15:08:01Z","timestamp":1442243281000},"page":"173-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets"],"prefix":"10.1007","volume":"77","author":[{"given":"Katharina T.","family":"Huber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"van Iersel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Moulton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celine","family":"Scornavacca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taoyang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,14]]},"reference":[{"issue":"3","key":"69_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV 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."},{"issue":"8","key":"69_CR2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.tig.2013.05.007","volume":"29","author":"E Bapteste","year":"2013","unstructured":"Bapteste, E., van Iersel, L.J.J., Janke, A., Kelchner, S., Kelk, S.M., McInerney, J.O., Morrison, D.A., Nakhleh, L., Steel, M., Stougie, L., Whitfield, J.: Networks: expanding evolutionary thinking. Trends Genet. 29(8), 439\u2013441 (2013)","journal-title":"Trends Genet."},{"issue":"1","key":"69_CR3","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TCBB.2008.70","volume":"6","author":"G Cardona","year":"2009","unstructured":"Cardona, G., Llabr\u00e9s, M., Rossell\u00f3, F., Valiente, G.: Metrics for phylogenetic networks I: generalizations of the Robinson-Foulds metric. IEEE\/ACM Trans. Comput. Biol. Bioinform. 6(1), 46\u201361 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"69_CR4","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":"69_CR5","first-page":"157","volume":"65","author":"P Gambette","year":"2012","unstructured":"Gambette, P., Huber, K.T.: On encodings of phylogenetic networks of bounded level. J. Mol. Biol. 65(1), 157\u2013180 (2012)","journal-title":"J. Mol. Biol."},{"key":"69_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, W. H. Freeman and Co., 1979, A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences"},{"key":"69_CR7","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 reconstruction of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2, 173\u2013213 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"69_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1080\/10635150601167013","volume":"56","author":"B Holland","year":"2007","unstructured":"Holland, B., Conner, G., Huber, K.T., Moulton, V.: Imputing supertrees and supernetworks from quartets. Syst. Biol. 56, 57\u201367 (2007)","journal-title":"Syst. Biol."},{"key":"69_CR9","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1093\/sysbio\/syu076","volume":"64","author":"KT Huber","year":"2014","unstructured":"Huber, K.T., van Iersel, L.J.J., Moulton, V., Wu, T.: How much information is needed to infer reticulate evolutionary histories? Syst. Biol. 64, 102\u2013111 (2014)","journal-title":"Syst. Biol."},{"issue":"3","key":"69_CR10","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1109\/TCBB.2010.17","volume":"8","author":"KT Huber","year":"2011","unstructured":"Huber, K.T., van Iersel, L.J.J., Kelk, S.M., Suchecki, R.: A practical algorithm for reconstructing level-1 phylogenetic networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(3), 635\u2013649 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"3","key":"69_CR11","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1007\/s00453-012-9659-x","volume":"66","author":"KT Huber","year":"2013","unstructured":"Huber, K.T., Moulton, V.: Encoding and constructing 1-nested phylogenetic networks with trinets. Algorithmica 66(3), 714\u2013738 (2013)","journal-title":"Algorithmica"},{"issue":"4","key":"69_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TCBB.2004.44","volume":"1","author":"D Huson","year":"2004","unstructured":"Huson, D., Dezulian, T., Klopper, T., Steel, M.: Phylogenetic super-networks from partial trees. IEEE\/ACM Trans. Comput. Biol. Bioinform. 1(4), 151\u2013158 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"69_CR13","doi-asserted-by":"crossref","unstructured":"Huson, D.H., Rupp, R.: Summarizing multiple gene trees using cluster networks. Workshop on Algorithms in Bioinformatics (WABI). Lecture Notes in Computer Science 5251, 296\u2013305 (2008)","DOI":"10.1007\/978-3-540-87361-7_25"},{"issue":"6","key":"69_CR14","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1093\/sysbio\/sys062","volume":"61","author":"DH Huson","year":"2012","unstructured":"Huson, D.H., Scornavacca, C.: Dendroscope 3: an interactive tool for rooted phylogenetic trees and networks. Syst. Biol. 61(6), 1061\u20131067 (2012)","journal-title":"Syst. Biol."},{"key":"69_CR15","unstructured":"Huynh, T.N.D., Jansson, J., Nguyen, N.B., Sung, W.-K.: Constructing a smallest refining galled phylogenetic network. Research in Computational Molecular Biology (RECOMB). Lecture Notes in Bioinformatics 3500, 265\u2013280 (2005)"},{"issue":"7","key":"69_CR16","first-page":"1707","volume":"68","author":"LJJ Iersel van","year":"2014","unstructured":"van Iersel, L.J.J., Moulton, V.: Trinets encode tree-child and level-2 phylogenetic networks. J. Math. Biol. 68(7), 1707\u20131729 (2014)","journal-title":"J. Math. Biol."},{"key":"69_CR17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.jda.2013.10.002","volume":"25","author":"J Jansson","year":"2014","unstructured":"Jansson, J., Lingas, A.: Computing the rooted triplet distance between galled trees by counting triangles. J. Discret. Algorithms 25, 66\u201378 (2014)","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"69_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(1), 60\u201368 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"69_CR19","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":"69_CR20","doi-asserted-by":"crossref","unstructured":"Ma, B., Wang, L., Li, M.: Fixed Topology Alignment with Recombination, Combinatorial Pattern Matching (CPM 1998). Lecture Notes in Computer Science 1448, 174\u2013188 (1998)","DOI":"10.1007\/BFb0030789"},{"issue":"4","key":"69_CR21","doi-asserted-by":"crossref","first-page":"e1004135","DOI":"10.1371\/journal.pcbi.1004135","volume":"11","author":"F Pardi","year":"2015","unstructured":"Pardi, F., Scornavacca, C.: Reconstructible phylogenetic networks: do not distinguish the indistinguishable. PLoS Comput. Biol. 11(4), e1004135 (2015)","journal-title":"PLoS Comput. Biol."},{"issue":"9","key":"69_CR22","doi-asserted-by":"crossref","first-page":"e106531","DOI":"10.1371\/journal.pone.0106531","volume":"9","author":"H Poormohammadi","year":"2014","unstructured":"Poormohammadi, H., Eslahchi, C., Tusserkani, R.: Constructing rooted phylogenetic networks from rooted triplets. PLoS One 9(9), e106531 (2014)","journal-title":"PLoS One"},{"key":"69_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"issue":"7","key":"69_CR24","doi-asserted-by":"crossref","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. Evol. 13(7), 964\u2013969 (1996)","journal-title":"Mol. Biol. Evol."},{"issue":"46","key":"69_CR25","doi-asserted-by":"crossref","first-page":"16448","DOI":"10.1073\/pnas.1407950111","volume":"111","author":"Y Yu","year":"2014","unstructured":"Yu, Y., Dong, J., Liu, K.J., Nakhleh, L.: Maximum likelihood inference of reticulate evolutionary histories. Proc. Nat. Acad. Sci. 111(46), 16448\u201316453 (2014)","journal-title":"Proc. Nat. Acad. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0069-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0069-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T03:25:14Z","timestamp":1718076314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0069-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,14]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["69"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0069-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2015,9,14]]}}}