{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:29:10Z","timestamp":1772782150095,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T00:00:00Z","timestamp":1542326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000736","name":"University of East Anglia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000736","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00357-018-9279-5","type":"journal-article","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T05:38:12Z","timestamp":1542346692000},"page":"200-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hierarchies from Lowest Stable Ancestors in Nonbinary Phylogenetic Networks"],"prefix":"10.1007","volume":"36","author":[{"given":"Katharina T.","family":"Huber","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Moulton","sequence":"additional","affiliation":[]},{"given":"Taoyang","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"9279_CR1","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/TCBB.2010.60","volume":"8","author":"G CARDONA","year":"2011","unstructured":"CARDONA, G., LLABRES, M., ROSSELLO, F., and VALIENTE, G. (2011), \u201cComparison of Galled Trees,\u201d IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 8, 410\u2013427.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"9279_CR2","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.jtbi.2010.05.031","volume":"265","author":"A DRESS","year":"2010","unstructured":"DRESS, A., MOULTON, V., STEEL, M., and WU, T. (2010), \u201cSpecies, Clusters and the \u2019Tree of life\u2019: A Graph-Theoretic Perspective,\u201d Journal of Theoretical Biology, 265, 535\u2013542.","journal-title":"Journal of Theoretical Biology"},{"key":"9279_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ipl.2010.02.014","volume":"110","author":"J FISCHER","year":"2010","unstructured":"FISCHER, J., and HUSON, D. (2010), \u201cNew Common Ancestor Problems in Trees and Directed Acyclic Graphs,\u201d Information Processing Letters, 110, 331\u2013335.","journal-title":"Information Processing Letters"},{"key":"9279_CR4","doi-asserted-by":"crossref","unstructured":"GUSFIELD, D. (2014), ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks, MIT Press.","DOI":"10.7551\/mitpress\/9432.001.0001"},{"key":"9279_CR5","first-page":"714","volume":"616","author":"KT HUBER","year":"2012","unstructured":"HUBER, K.T., and MOULTON, V. (2012), \u201cEncoding and Constructing 1-Nested Phylogenetic Networks with Trinets,\u201d Algorithmica, 616, 714\u2013738.","journal-title":"Algorithmica"},{"key":"9279_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-015-0069-8","volume":"77","author":"KT HUBER","year":"2017","unstructured":"HUBER, K.T., VAN IERSEL, L.,MOULTON, V., SCORNAVACCA, C., and WU, T. (2017), \u201cReconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets,\u201d Algorithmica, 77, 173\u2013200.","journal-title":"Algorithmica"},{"key":"9279_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1093\/sysbio\/syu076","volume":"64","author":"KT HUBER","year":"2015","unstructured":"HUBER, K.T., VAN IERSEL, L., MOULTON, V., and WU, T. (2015), \u201cHow Much Information is Needed to Infer Reticulate Evolutionary Histories,\u201d Systematic Biology, 64, 102\u2013111.","journal-title":"Systematic Biology"},{"key":"9279_CR8","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/TCBB.2010.17","volume":"8","author":"KT HUBER","year":"2011","unstructured":"HUBER, K.T., VAN IERSEL, L., KELK, S., and SUCHECKI, R. (2011), \u201cA Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks,\u201d IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 8, 635\u2013649.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"9279_CR9","doi-asserted-by":"crossref","unstructured":"HUSON, D.H., RUPP, R., and SCORNAVACCA, C. (2010), Phylogenetic Networks: Concepts, Algorithms and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511974076"},{"key":"9279_CR10","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1137\/S0097539704446529","volume":"35","author":"J JANSSON","year":"2006","unstructured":"JANSSON, J., NGUYEN, N., and SUNG, W.-K. (2006), \u201cAlgorithms for Combining Rooted Triplets into a Galled Phylogenetic Network,\u201d SIAM Journal of Computing, 35, 1098\u20131121.","journal-title":"SIAM Journal of Computing"},{"key":"9279_CR11","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., and SUNG, W.-K. (2006), \u201cInferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets,\u201d Theoretical Computer Science, 363, 60\u201368.","journal-title":"Theoretical Computer Science"},{"key":"9279_CR12","unstructured":"JETTEN, L., and VAN IERSEL, L. (2016), \u201cNonbinary Tree-Based Phylogenetic Networks,\u201d IEEE\/ACM Transactions on Computational Biology and Bioinformatics, in press."},{"key":"9279_CR13","unstructured":"LOV\u00c1SZ, L., and PLUMMER, M.D. (1986), Matching Theory (Vol. 121, North-Holland Mathematics Studies), Elsevier Science Ltd."},{"key":"9279_CR14","unstructured":"NAKHLEH, L. (2011), \u201cEvolutionary Phylogenetic Networks: Models and Issues,\u201d in Problem Solving Handbook in Computational Biology and Bioinformatics, Springer, pp. 125\u2013158."},{"key":"9279_CR15","doi-asserted-by":"publisher","first-page":"2151","DOI":"10.1093\/molbev\/msw068","volume":"33","author":"J OLDMAN","year":"2016","unstructured":"OLDMAN, J.,WU, T., VAN IERSEL, L., and MOULTON, V. (2016), \u201cTrilonet: Piecing Together Small Networks to Reconstruct Reticulate Evolutionary Histories,\u201d Molecular Biology and Evolution, 33, 2151\u20132162.","journal-title":"Molecular Biology and Evolution"},{"key":"9279_CR16","doi-asserted-by":"crossref","unstructured":"SEMPLE, C., and STEEL, M. (2003), Phylogenetics, Oxford University Press.","DOI":"10.1093\/oso\/9780198509424.001.0001"},{"key":"9279_CR17","doi-asserted-by":"crossref","unstructured":"TO, T,-H, and HABIB, M. (2009), \u201cLevel-k Phylogenetic Networks are Constructable from a Dense Triplet Set in Polynomial Time\u201d, in Annual Symposium on Combinatorial Pattern Matching, Springer, pp. 275\u2013288.","DOI":"10.1007\/978-3-642-02441-2_25"},{"key":"9279_CR18","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/TCBB.2009.22","volume":"6","author":"L VAN IERSEL","year":"2009","unstructured":"VAN IERSEL, L., KEIJSPER, J., KELK, S., STOUGIE, L., HAGEN, F., and BOEKHOUT, T. (2009), \u201cConstructing Level-2 Phylogenetic Networks from Triplets,\u201d IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 6, 667\u2013681.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"9279_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00453-009-9333-0","volume":"60","author":"L VAN IERSEL","year":"2011","unstructured":"VAN IERSEL, L., and KELK, S. (2011), \u201cConstructing the Simplest Possible Phylogenetic Network from Triplets,\u201d Algorithmica, 60, 207\u2013235.","journal-title":"Algorithmica"},{"key":"9279_CR20","first-page":"1707","volume":"68","author":"L VAN IERSEL","year":"2014","unstructured":"VAN IERSEL, L., and MOULTON, V. (2014), \u201cTrinets Encode Tree-Child and Level-2 Phylogenetic Networks,\u201d Journal of Mathematical Biology, 68, 1707\u20131729.","journal-title":"Journal of Mathematical Biology"},{"key":"9279_CR21","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1007\/s11538-017-0275-4","volume":"79","author":"L VAN IERSEL","year":"2017","unstructured":"VAN IERSEL, L., MOULTON, V., DE SWART, E., and WU, T. (2017), \u201cBinets: Fundamental Building Blocks for Phylogenetic Networks,\u201d Bulletin of Mathematical Biology, 79, 1135\u20131154.","journal-title":"Bulletin of Mathematical Biology"}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-018-9279-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00357-018-9279-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-018-9279-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:41:24Z","timestamp":1720788084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00357-018-9279-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,16]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9279"],"URL":"https:\/\/doi.org\/10.1007\/s00357-018-9279-5","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"value":"0176-4268","type":"print"},{"value":"1432-1343","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,16]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}