{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:30:02Z","timestamp":1743078602619,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-49193-1_17","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"225-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fitch Graph Completion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1620-5508","authenticated-orcid":false,"given":"Marc","family":"Hellmuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5016-5191","authenticated-orcid":false,"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7745-3935","authenticated-orcid":false,"given":"Sandhya","family":"Thekkumpadan Puthiyaveedu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/aima.1998.1743","volume":"138","author":"S B\u00f6cker","year":"1998","unstructured":"B\u00f6cker, S., Dress, A.W.M.: Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv. Math. 138, 105\u2013125 (1998). https:\/\/doi.org\/10.1006\/aima.1998.1743","journal-title":"Adv. Math."},{"key":"17_CR2","first-page":"163","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Steward Burlingham, L.: Complement Reducible Graphs. Discr. Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Appl. Math."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1016\/j.dam.2006.03.005","volume":"154","author":"C Crespelle","year":"2006","unstructured":"Crespelle, C., Paul, C.: Fully dynamic recognition algorithm and certificate for directed cographs. Discr. Appl. Math. 154, 1722\u20131741 (2006)","journal-title":"Discr. Appl. Math."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(94)00272-X","volume":"154","author":"J Engelfriet","year":"1996","unstructured":"Engelfriet, J., Harju, T., Proskurowski, A., Rozenberg, G.: Characterization and complexity of uniformly nonprimitive labeled 2-structures. Theor. Comp. Sci. 154, 247\u2013282 (1996)","journal-title":"Theor. Comp. Sci."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s00285-018-1260-8","volume":"77","author":"M Gei\u00df","year":"2018","unstructured":"Gei\u00df, M., Anders, J., Stadler, P.F., Wieseke, N., Hellmuth, M.: Reconstructing gene trees from fitch\u2019s xenology relation. J. Math. Biol. 77, 1459\u20131491 (2018). https:\/\/doi.org\/10.1007\/s00285-018-1260-8","journal-title":"J. Math. Biol."},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.19139\/soic.v5i1.260","volume":"5","author":"F Gurski","year":"2017","unstructured":"Gurski, F.: Dynamic programming algorithms on directed cographs. Stat. Optim. Inf. Comput. 5(1), 35\u201344 (2017). https:\/\/doi.org\/10.19139\/soic.v5i1.260","journal-title":"Stat. Optim. Inf. Comput."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Scholz, G.E.: Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (2023). http:\/\/arxiv.org\/abs\/10.48550\/arXiv.2211.16854","DOI":"10.2139\/ssrn.4334388"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s00285-019-01384-x","volume":"79","author":"M Hellmuth","year":"2019","unstructured":"Hellmuth, M., Seemann, C.R.: Alternative characterizations of Fitch\u2019s xenology relation. J. Math. Biol. 79(3), 969\u2013986 (2019). https:\/\/doi.org\/10.1007\/s00285-019-01384-x","journal-title":"J. Math. Biol."},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Hellmuth, M., Stadler, P.F., Puthiyaveedu, S.T.: Fitch graph completion (2023). https:\/\/doi.org\/10.48550\/arXiv.2306.06878","DOI":"10.48550\/arXiv.2306.06878"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5, 558\u2013562 (1962). https:\/\/doi.org\/10.1145\/368996.369025","journal-title":"Commun. ACM"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, pp. 85\u2013103. Springer, US, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.dam.2004.02.017","volume":"145","author":"RM McConnell","year":"2005","unstructured":"McConnell, R.M., De Montgolfier, F.: Linear-time modular decomposition of directed graphs. Discr. Appl. Math. 145(2), 198\u2013209 (2005). https:\/\/doi.org\/10.1016\/j.dam.2004.02.017","journal-title":"Discr. Appl. Math."},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"N\u00f8jgaard, N., El-Mabrouk, N., Merkle, D., Wieseke, N., Hellmuth, M.: Partial homology relations - satisfiability in terms of di-cographs. In: Wang, L., Zhu, D. (eds.) Computing and Combinatorics. Lecture Notes Comp. Sci., vol. 10976, pp. 403\u2013415. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_34","DOI":"10.1007\/978-3-319-94776-1_34"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"e1004095","DOI":"10.1371\/journal.pcbi.1004095","volume":"11","author":"M Ravenhall","year":"2015","unstructured":"Ravenhall, M., \u0160kunca, N., Lassalle, F., Dessimoz, C.: Inferring horizontal gene transfer. PLoS Comp. Biol. 11, e1004095 (2015). https:\/\/doi.org\/10.1371\/journal.pcbi.1004095","journal-title":"PLoS Comp. Biol."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:05:34Z","timestamp":1702026334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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","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":"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)"}}]}}