{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:28:21Z","timestamp":1742984901927,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031062193"},{"type":"electronic","value":"9783031062209"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06220-9_4","type":"book-chapter","created":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T12:10:26Z","timestamp":1652530226000},"page":"52-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Sackin Index of\u00a0Simplex Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0260-824X","authenticated-orcid":false,"given":"Louxin","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,15]]},"reference":[{"issue":"12","key":"4_CR1","doi-asserted-by":"publisher","first-page":"6756","DOI":"10.1002\/ece3.5185","volume":"9","author":"M Avino","year":"2019","unstructured":"Avino, M., Ng, G.T., He, Y., Renaud, M.S., Jones, B.R., Poon, A.F.: Tree shape-based approaches for the comparative study of cophylogeny. Ecol. Evol. 9(12), 6756\u20136771 (2019)","journal-title":"Ecol. Evol."},{"key":"4_CR2","unstructured":"Bienvenu, F., Lambert, A., Steel, M.: Combinatorial and stochastic properties of ranked tree-child networks. arXiv preprint arXiv:2007.09701 (2020)"},{"issue":"6","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1007\/s00285-020-01543-5","volume":"81","author":"M Bouvel","year":"2020","unstructured":"Bouvel, M., Gambette, P., Mansouri, M.: Counting phylogenetic networks of level 1 and 2. J. Math. Biol. 81(6), 1357\u20131395 (2020)","journal-title":"J. Math. Biol."},{"issue":"9","key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1007347","volume":"15","author":"G Cardona","year":"2019","unstructured":"Cardona, G., Pons, J.C., Scornavacca, C.: Generation of binary tree-child phylogenetic networks. PLoS Comput. Biol. 15(9), e1007347 (2019)","journal-title":"PLoS Comput. Biol."},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/TCBB.2007.70270","volume":"6","author":"G Cardona","year":"2009","unstructured":"Cardona, G., Rossell\u00f3, F., Valiente, G.: Comparison of tree-child phylogenetic networks. IEEE\/ACM-TCBB 6(4), 552\u2013569 (2009). https:\/\/doi.org\/10.1109\/TCBB.2007.70270","journal-title":"IEEE\/ACM-TCBB"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jcss.2020.06.001","volume":"114","author":"G Cardona","year":"2020","unstructured":"Cardona, G., Zhang, L.: Counting and enumerating tree-child networks and their subclasses. J. Comput. Syst. Sci. 114, 84\u2013104 (2020)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","volume":"25","author":"P Flajolet","year":"1982","unstructured":"Flajolet, P., Odlyzko, A.: The average height of binary trees and other simple trees. J. Comput. Syst. Sci. 25(2), 171\u2013213 (1982)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1093\/sysbio\/syv037","volume":"64","author":"AR Francis","year":"2015","unstructured":"Francis, A.R., Steel, M.: Which phylogenetic networks are merely trees with additional arcs? Syst. Biol. 64(5), 768\u2013777 (2015)","journal-title":"Syst. Biol."},{"key":"4_CR9","unstructured":"Fuchs, M., Yu, G.R., Zhang, L.: Asymptotic enumeration and distributional properties of galled networks. arXiv preprint arXiv:2010.13324 (2020)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"103278","DOI":"10.1016\/j.ejc.2020.103278","volume":"93","author":"M Fuchs","year":"2021","unstructured":"Fuchs, M., Yu, G.R., Zhang, L.: On the asymptotic growth of the number of tree-child networks. Eur. J. Comb. 93, 103278 (2021)","journal-title":"Eur. J. Comb."},{"key":"4_CR11","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"RL Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Boston (1989)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ic.2016.11.001","volume":"252","author":"AD Gunawan","year":"2017","unstructured":"Gunawan, A.D., DasGupta, B., Zhang, L.: A decomposition theorem and two algorithms for reticulation-visible networks. Inf. Comput. 252, 161\u2013175 (2017)","journal-title":"Inf. Comput."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.dam.2020.03.005","volume":"283","author":"AD Gunawan","year":"2020","unstructured":"Gunawan, A.D., Rathin, J., Zhang, L.: Counting and enumerating galled networks. Discret. Appl. Math. 283, 644\u2013654 (2020)","journal-title":"Discret. Appl. Math."},{"key":"4_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9432.001.0001","volume-title":"ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks","author":"D Gusfield","year":"2014","unstructured":"Gusfield, D.: ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks. MIT Press, Cambridge (2014)"},{"key":"4_CR15","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proceedings of CSB 2003 (2003)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-71681-5_15","volume-title":"Research in Computational Molecular Biology","author":"DH Huson","year":"2007","unstructured":"Huson, D.H., Kl\u00f6pper, T.H.: Beyond galled trees - decomposition and computation of galled networks. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS, vol. 4453, pp. 211\u2013225. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71681-5_15"},{"key":"4_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511974076","volume-title":"Phylogenetic Networks: Concepts, Algorithms and Applications","author":"DH Huson","year":"2010","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00026-015-0260-2","volume":"19","author":"C McDiarmid","year":"2015","unstructured":"McDiarmid, C., Semple, C., Welsh, D.: Counting phylogenetic networks. Ann. Comb. 19(1), 205\u2013224 (2015). https:\/\/doi.org\/10.1007\/s00026-015-0260-2","journal-title":"Ann. Comb."},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.mbs.2012.10.005","volume":"241","author":"A Mir","year":"2013","unstructured":"Mir, A., Rossell\u00f3, F., Rotger, L.A.: A new balance index for phylogenetic trees. Math. Biosci. 241(1), 125\u2013136 (2013)","journal-title":"Math. Biosci."},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-79139-8","volume":"11","author":"M Pons","year":"2021","unstructured":"Pons, M., Batle, J.: Combinatorial characterization of a certain class of words and a conjectured connection with general subclasses of phylogenetic tree-child networks. Sci. Rep. 11(1), 1\u201314 (2021)","journal-title":"Sci. Rep."},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1093\/sysbio\/21.2.225","volume":"21","author":"MJ Sackin","year":"1972","unstructured":"Sackin, M.J.: \u201cGood\u2019\u2019 and \u201cbad\u2019\u2019 phenograms. Syst. Biol. 21(2), 225\u2013226 (1972)","journal-title":"Syst. Biol."},{"issue":"3","key":"4_CR22","first-page":"266","volume":"39","author":"KT Shao","year":"1990","unstructured":"Shao, K.T., Sokal, R.R.: Tree balance. Syst. Zool. 39(3), 266\u2013276 (1990)","journal-title":"Syst. Zool."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Steel, M.: Phylogeny: discrete and random processes in evolution. SIAM (2016)","DOI":"10.1137\/1.9781611974485"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Stufler, B.: A branching process approach to level-$$k$$ phylogenetic networks. Random Struct. Algorithms (2021). https:\/\/doi.org\/10.1002\/rsa.21065","DOI":"10.1002\/rsa.21065"},{"issue":"14","key":"4_CR25","doi-asserted-by":"publisher","first-page":"7879","DOI":"10.1073\/pnas.1915088117","volume":"117","author":"C Xue","year":"2020","unstructured":"Xue, C., Liu, Z., Goldenfeld, N.: Scale-invariant topology and bursty branching of evolutionary trees emerge from niche construction. Proc. Natl. Acad. Sci. 117(14), 7879\u20137887 (2020)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"20","key":"4_CR26","first-page":"1","volume":"20","author":"L Zhang","year":"2019","unstructured":"Zhang, L.: Generating normal networks via leaf insertion and nearest neighbor interchange. BMC Bioinform. 20(20), 1\u20139 (2019)","journal-title":"BMC Bioinform."},{"key":"4_CR27","series-title":"Computational Biology","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-10837-3_12","volume-title":"Bioinformatics and Phylogenetics","author":"L Zhang","year":"2019","unstructured":"Zhang, L.: Clusters, trees, and phylogenetic network classes. In: Warnow, T. (ed.) Bioinformatics and Phylogenetics. CB, vol. 29, pp. 277\u2013315. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10837-3_12"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06220-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T12:10:38Z","timestamp":1652530238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06220-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031062193","9783031062209"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06220-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB-CG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"RECOMB International Workshop on Comparative Genomics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Jolla, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recombcg2022.usask.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}