{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:49:06Z","timestamp":1743029346296,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_24","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"290-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing the Rooted Triplet Distance Between Phylogenetic Networks"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Mampentzidis","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Rajaby","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"24_CR1","unstructured":"Brodal, G.S., Mampentzidis, K.: Cache oblivious algorithms for computing the triplet distance between trees. In: Proceedings of ESA 2017, pp. 21:1\u201321:14 (2017)"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.jda.2009.01.004","volume":"8","author":"J Byrka","year":"2010","unstructured":"Byrka, J., Gawrychowski, P., Huber, K.T., Kelk, S.: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J. Discrete Algorithms 8(1), 65\u201375 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1186\/1471-2105-9-532","volume":"9","author":"G Cardona","year":"2008","unstructured":"Cardona, G., Rossell\u00f3, F., Valiente, G.: Extended Newick: it is time for a standard representation of phylogenetic networks. BMC Bioinform. 9(1), 532 (2008)","journal-title":"BMC Bioinform."},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2004.12.012","volume":"335","author":"C Choy","year":"2005","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.K.: Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1), 93\u2013107 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR5","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BFb0069548","volume-title":"Combinatorial Mathematics III","author":"AJ Dobson","year":"1975","unstructured":"Dobson, A.J.: Comparing the shapes of trees. In: Street, A.P., Wallis, W.D. (eds.) Combinatorial Mathematics III. Lecture Notes in Mathematics, vol. 452, pp. 95\u2013100. Springer, Berlin (1975). https:\/\/doi.org\/10.1007\/BFb0069548"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2413326","volume":"34","author":"G Estabrook","year":"1985","unstructured":"Estabrook, G., McMorris, F., Meacham, C.: Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst. Zool. 34(2), 193\u2013200 (1985)","journal-title":"Syst. Zool."},{"key":"24_CR7","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Inc., Sunderland (2004)"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"24_CR9","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."},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00285-011-0456-y","volume":"65","author":"P Gambette","year":"2012","unstructured":"Gambette, P., Huber, K.T.: On encodings of phylogenetic networks of bounded level. J. Math. Biol. 65(1), 157\u2013180 (2012)","journal-title":"J. Math. Biol."},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0219720004000521","volume":"2","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2(1), 173\u2013213 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.jda.2013.10.002","volume":"25","author":"J Jansson","year":"2014","unstructured":"Jansson, J., Lingas, A.: Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms 25, 66\u201378 (2014)","journal-title":"J. Discrete Algorithms"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-58163-7_8","volume-title":"Algorithms for Computational Biology","author":"Jesper Jansson","year":"2017","unstructured":"Jansson, J., Rajaby, R., Sung, W.K.: An efficient algorithm for the rooted triplet distance between galled trees. In: Proceedings of AlCoB 2017, pp. 115\u2013126 (2017)"},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TCBB.2016.2615918","volume":"1","author":"L Jetten","year":"2018","unstructured":"Jetten, L., van Iersel, L.: Nonbinary tree-based phylogenetic networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. 1(1), 205\u2013217 (2018)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1093\/sysbio\/syu071","volume":"64","author":"T Marcussen","year":"2015","unstructured":"Marcussen, T., Heier, L., Brysting, A.K., Oxelman, B., Jakobsen, K.S.: From gene trees to a dated allopolyploid network: insights from the angiosperm genus viola (violaceae). Syst. Biol. 64(1), 84\u2013101 (2015)","journal-title":"Syst. Biol."},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0025-5564(99)00060-7","volume":"164","author":"A McKenzie","year":"2000","unstructured":"McKenzie, A., Steel, M.: Distributions of cherries for two models of trees. Math. Biosci. 164(1), 81\u201392 (2000)","journal-title":"Math. Biosci."},{"issue":"1","key":"24_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D Robinson","year":"1981","unstructured":"Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Math. Biosci. 53(1), 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y Shiloach","year":"1978","unstructured":"Shiloach, Y., Perl, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. ACM 25(1), 1\u20139 (1978)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:14:59Z","timestamp":1710350099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","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":"73","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":"36","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":"49% - 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":"5-6","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)"}}]}}