{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T22:22:16Z","timestamp":1774736536143,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030422653","type":"print"},{"value":"9783030422660","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-42266-0_7","type":"book-chapter","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T14:03:01Z","timestamp":1584972181000},"page":"77-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Combining Networks Using Cherry Picking Sequences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5192-1470","authenticated-orcid":false,"given":"Remie","family":"Janssen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4091-7089","authenticated-orcid":false,"given":"Mark","family":"Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1355-5884","authenticated-orcid":false,"given":"Yukihiro","family":"Murakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,3]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00026-004-0228-0","volume":"8","author":"M Baroni","year":"2005","unstructured":"Baroni, M., Semple, C., Steel, M.: A framework for representing reticulate evolution. Ann. Comb. 8(4), 391\u2013408 (2005)","journal-title":"Ann. Comb."},{"issue":"8","key":"7_CR2","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. Discret. Appl. Math. 155(8), 914\u2013928 (2007)","journal-title":"Discret. Appl. Math."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.mbs.2019.04.009","volume":"313","author":"PL Erd\u0151s","year":"2019","unstructured":"Erd\u0151s, P.L., Semple, C., Steel, M.: A class of phylogenetic networks reconstructable from ancestral profiles. Math. Biosci. 313, 33\u201340 (2019)","journal-title":"Math. Biosci."},{"issue":"8","key":"7_CR4","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s11538-018-0450-2","volume":"80","author":"KT Huber","year":"2018","unstructured":"Huber, K.T., Moulton, V., Semple, C., Wu, T.: Quarnet inference rules for level-1 networks. Bull. Math. Biol. 80(8), 2137\u20132153 (2018)","journal-title":"Bull. Math. Biol."},{"issue":"1","key":"7_CR5","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., Wu, T.: Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets. Algorithmica 77(1), 173\u2013200 (2017)","journal-title":"Algorithmica"},{"issue":"10","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1007\/s11538-013-9874-x","volume":"75","author":"PJ Humphries","year":"2013","unstructured":"Humphries, P.J., Linz, S., Semple, C.: Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies. Bull. Math. Biol. 75(10), 1879\u20131890 (2013)","journal-title":"Bull. Math. Biol."},{"key":"7_CR7","unstructured":"van Iersel, L., Janssen, R., Jones, M., Murakami, Y., Zeh, N.: A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees. arXiv preprint \narXiv:1907.08474\n\n (2019)"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/15M1036579","volume":"30","author":"L van Iersel","year":"2016","unstructured":"van Iersel, L., Kelk, S., Lekic, N., Whidden, C., Zeh, N.: Hybridization number on three rooted binary trees is EPT. SIAM J. Discret. Math. 30(3), 1607\u20131631 (2016)","journal-title":"SIAM J. Discret. Math."},{"issue":"9","key":"7_CR9","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.ipl.2013.02.010","volume":"113","author":"L van Iersel","year":"2013","unstructured":"van Iersel, L., Linz, S.: A quadratic kernel for computing the hybridization number of multiple trees. Inf. Process. Lett. 113(9), 318\u2013323 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"7_CR10","first-page":"1707","volume":"68","author":"L van Iersel","year":"2014","unstructured":"van Iersel, L., Moulton, V.: Trinets encode tree-child and level-2 phylogenetic networks. J. Math. Biol. 68(7), 1707\u20131729 (2014)","journal-title":"J. Math. Biol."},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1137\/17M1111930","volume":"32","author":"L van Iersel","year":"2018","unstructured":"van Iersel, L., Moulton, V.: Leaf-reconstructibility of phylogenetic networks. SIAM J. Discret. Math. 32(3), 2047\u20132066 (2018)","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"7_CR12","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., Wu, T.: Binets: fundamental building blocks for phylogenetic networks. Bull. Math. Biol. 79(5), 1135\u20131154 (2017)","journal-title":"Bull. Math. Biol."},{"key":"7_CR13","unstructured":"Janssen, R., Murakami, Y.: Solving phylogenetic network containment problems using cherry-picking sequences. arXiv preprint \narXiv:1812.08065\n\n (2018)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.aam.2019.01.004","volume":"105","author":"S Linz","year":"2019","unstructured":"Linz, S., Semple, C.: Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. Adv. Appl. Math. 105, 102\u2013129 (2019)","journal-title":"Adv. Appl. Math."},{"issue":"10","key":"7_CR15","doi-asserted-by":"publisher","first-page":"3823","DOI":"10.1007\/s11538-019-00641-w","volume":"81","author":"Y Murakami","year":"2019","unstructured":"Murakami, Y., van Iersel, L., Janssen, R., Jones, M., Moulton, V.: Reconstructing tree-child networks from reticulate-edge-deleted subnetworks. Bull. Math. Biol. 81(10), 3823\u20133863 (2019)","journal-title":"Bull. Math. Biol."},{"issue":"8","key":"7_CR16","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., Moulton, V.: Trilonet: piecing together small networks to reconstruct reticulate evolutionary histories. Mol. Biol. Evol. 33(8), 2151\u20132162 (2016)","journal-title":"Mol. Biol. Evol."},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1137\/110845045","volume":"42","author":"C Whidden","year":"2013","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fixed-parameter algorithms for maximum agreement forests. SIAM J. Comput. 42(4), 1431\u20131466 (2013)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42266-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T13:04:36Z","timestamp":1588597476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-42266-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030422653","9783030422660"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42266-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Missoula, MT","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/alcob2020.irdta.eu\/","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":"24","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":"15","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":"63% - 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":"3","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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was postponed to be held together with AlCoB 2021 due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}