{"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":1774736536300,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"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_8","type":"book-chapter","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T14:03:01Z","timestamp":1584972181000},"page":"93-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Linear Time Algorithm for Tree-Child Network Containment"],"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-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":"8","key":"8_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.tig.2013.05.007","volume":"29","author":"E Bapteste","year":"2013","unstructured":"Bapteste, E., et al.: Networks: expanding evolutionary thinking. Trends Genet. 29(8), 439\u2013441 (2013)","journal-title":"Trends Genet."},{"issue":"9","key":"8_CR2","doi-asserted-by":"publisher","first-page":"e1007347","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":"8_CR3","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/TCBB.2007.70270","volume":"6","author":"G Cardona","year":"2009","unstructured":"Cardona, G., Rossello, F., Valiente, G.: Comparison of tree-child phylogenetic networks. IEEE\/ACM Trans. Comput. Biol. Bioinf. 6(4), 552\u2013569 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.dam.2019.01.031","volume":"260","author":"J D\u00f6cker","year":"2019","unstructured":"D\u00f6cker, J., van Iersel, L., Kelk, S., Linz, S.: Deciding the existence of a cherry-picking sequence is hard on two trees. Discrete Appl. Math. 260, 131\u2013143 (2019)","journal-title":"Discrete Appl. Math."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-29516-9_17","volume-title":"Combinatorial Algorithms","author":"P Gambette","year":"2016","unstructured":"Gambette, P., Gunawan, A.D.M., Labarre, A., Vialette, S., Zhang, L.: Solving the tree containment problem for genetically stable networks in quadratic time. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 197\u2013208. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29516-9_17"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2017.07.015","volume":"246","author":"P Gambette","year":"2018","unstructured":"Gambette, P., Gunawan, A.D., Labarre, A., Vialette, S., Zhang, L.: Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discrete Appl. Math. 246, 62\u201379 (2018)","journal-title":"Discrete Appl. Math."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gunawan, A.: Solving tree containment problem for reticulation-visible networks with optimal running time. arXiv preprint \narXiv:1702.04088\n\n (2017)","DOI":"10.1007\/978-3-319-91938-6_3"},{"issue":"23","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.ipl.2010.07.027","volume":"110","author":"LV Iersel","year":"2010","unstructured":"Iersel, L.V., Semple, C., Steel, M.: Locating a tree in a phylogenetic network. Inf. Process. Lett. 110(23), 1037\u20131043 (2010)","journal-title":"Inf. Process. Lett."},{"key":"8_CR9","unstructured":"Janssen, R., Murakami, Y.: Solving phylogenetic network containment problems using cherry-picking sequences. arXiv preprint \narXiv:1812.08065\n\n (2018)"},{"issue":"1\u20133","key":"8_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2008.04.019","volume":"401","author":"IA Kanj","year":"2008","unstructured":"Kanj, I.A., Nakhleh, L., Than, C., Xia, G.: Seeing the trees and their branches in the network is hard. Theoret. Comput. Sci. 401(1\u20133), 153\u2013164 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR11","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":"5","key":"8_CR12","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.ijpara.2005.02.007","volume":"35","author":"DA Morrison","year":"2005","unstructured":"Morrison, D.A.: Networks in phylogenetic analysis: new tools for population biology. Int. J. Parasitol. 35(5), 567\u2013582 (2005)","journal-title":"Int. J. Parasitol."}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T13:04:32Z","timestamp":1588597472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-42266-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030422653","9783030422660"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42266-0_8","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"}]}}