{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:52:13Z","timestamp":1742928733883,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_3","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"40-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relaxed Agreement Forests"],"prefix":"10.1007","author":[{"given":"Virginia","family":"Ard\u00e9vol Mart\u00ednez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Chaplick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"Meuwese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Stamoulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B Allen","year":"2001","unstructured":"Allen, B., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Comb. 5, 1\u201315 (2001)","journal-title":"Ann. Comb."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ardevol\u00a0Martinez, V., Chaplick, S., Kelk, S., Meuwese, R., Mihal\u00e1k, M., Stamoulis, G.: Relaxed agreement forests. arXiv:2309.01110 [cs.DS] (2023)","DOI":"10.1007\/978-3-031-52113-3_3"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-018-0410-4","volume":"23","author":"R Atkins","year":"2019","unstructured":"Atkins, R., McDiarmid, C.: Extremal distances for subtree transfer operations in binary trees. Ann. Comb. 23, 1\u201326 (2019)","journal-title":"Ann. Comb."},{"issue":"5","key":"3_CR4","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s002360050126","volume":"35","author":"R Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Fogel, S.: Partitioning a sequence into few monotone subsequences. Acta Inform. 35(5), 421\u2013440 (1998)","journal-title":"Acta Inform."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M Bordewich","year":"2005","unstructured":"Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Comb. 8(4), 409\u2013423 (2005)","journal-title":"Ann. Comb."},{"issue":"12","key":"3_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.3390\/a12120256","volume":"12","author":"L Bulteau","year":"2019","unstructured":"Bulteau, L., Weller, M.: Parameterized algorithms in bioinformatics: an overview. Algorithms 12(12), 256 (2019)","journal-title":"Algorithms"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1007\/s00453-015-0087-6","volume":"76","author":"J Chen","year":"2016","unstructured":"Chen, J., Shi, F., Wang, J.: Approximating maximum agreement forest on multiple binary trees. Algorithmica 76, 867\u2013889 (2016)","journal-title":"Algorithmica"},{"issue":"6","key":"3_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.tree.2009.01.009","volume":"24","author":"J Degnan","year":"2009","unstructured":"Degnan, J., Rosenberg, N.: Gene tree discordance, phylogenetic inference and the multispecies coalescent. Trends Ecol. Evol. 24(6), 332\u2013340 (2009)","journal-title":"Trends Ecol. Evol."},{"key":"3_CR10","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"issue":"5","key":"3_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0020-0190(02)00288-0","volume":"84","author":"F Fomin","year":"2002","unstructured":"Fomin, F., Kratsch, D., Novelli, J.C.: Approximating minimum cocolorings. Inf. Process. Lett. 84(5), 285\u2013290 (2002)","journal-title":"Inf. Process. Lett."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Grass Phylogeny Working Group, et\u00a0al.: Phylogeny and subfamilial classification of the grasses (Poaceae). Ann. Missouri Botanical Garden 88(3), 373\u2013457 (2001)","DOI":"10.2307\/3298585"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ic.2013.08.007","volume":"231","author":"P Heggernes","year":"2013","unstructured":"Heggernes, P., Kratsch, D., Lokshtanov, D., Raman, V., Saurabh, S.: Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization. Inf. Comput. 231, 109\u2013116 (2013)","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"3_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J Hein","year":"1996","unstructured":"Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discret. Appl. Math. 71(1\u20133), 153\u2013169 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1093\/sysbio\/syx094","volume":"67","author":"LV Iersel","year":"2018","unstructured":"Iersel, L.V., Jones, M., Scornavacca, C.: Improved maximum parsimony models for phylogenetic networks. Syst. Biol. 67(3), 518\u2013542 (2018)","journal-title":"Syst. Biol."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.7155\/jgaa.00390","volume":"2","author":"S Kelk","year":"2016","unstructured":"Kelk, S., van Iersel, L., Scornavacca, C., Weller, M.: Phylogenetic incongruence through the lens of monadic second order logic. J. Graph Algorithms Appl. 2, 189\u2013215 (2016)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0097-3165(96)80012-4","volume":"73","author":"A K\u00e9zdy","year":"1996","unstructured":"K\u00e9zdy, A., Snevily, H., Wang, C.: Partitioning permutations into increasing and decreasing subsequences. J. Comb. Theory Ser. A 73(2), 353\u2013359 (1996)","journal-title":"J. Comb. Theory Ser. A"},{"key":"3_CR18","unstructured":"Kubicka, E., Kubicki, G., McMorris, F.: On agreement subtrees of two binary trees. Congressus Numerantium 217 (1992)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Lemey, P., Salemi, M., Vandamme, A.M.: The Phylogenetic Handbook: A Practical Approach to Phylogenetic Analysis and Hypothesis Testing. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511819049"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.dam.2020.07.007","volume":"285","author":"A Markin","year":"2020","unstructured":"Markin, A.: On the extremal maximum agreement subtree problem. Discret. Appl. Math. 285, 612\u2013620 (2020)","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"3_CR21","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.tree.2013.09.004","volume":"28","author":"L Nakhleh","year":"2013","unstructured":"Nakhleh, L.: Computational approaches to species phylogeny inference and gene tree reconciliation. Trends Ecol. Evol. 28(12), 719\u2013728 (2013)","journal-title":"Trends Ecol. Evol."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Steel, M.: Phylogeny: Discrete and Random Processes in Evolution. SIAM (2016)","DOI":"10.1137\/1.9781611974485"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M Steel","year":"1993","unstructured":"Steel, M., Warnow, T.: Kaikoura tree theorems: computing the maximum agreement subtree. Inf. Process. Lett. 48(2), 77\u201382 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"12","key":"3_CR25","first-page":"633","volume":"20","author":"K Wagner","year":"1984","unstructured":"Wagner, K.: Monotonic coverings of finite sets. J. Inf. Process. Cybern. 20(12), 633\u2013639 (1984)","journal-title":"J. Inf. Process. Cybern."},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10479-021-04352-1","volume":"309","author":"R van Wersch","year":"2022","unstructured":"van Wersch, R., Kelk, S., Linz, S., Stamoulis, G.: Reflections on kernelizing and computing unrooted agreement forests. Ann. Oper. Res. 309(1), 425\u2013451 (2022)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:02:57Z","timestamp":1711569777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"41% - 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.11","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":"7","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)"}}]}}