{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:44:43Z","timestamp":1757540683384,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030918132"},{"type":"electronic","value":"9783030918149"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91814-9_5","type":"book-chapter","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T20:00:31Z","timestamp":1637697631000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Combining Orthology and Xenology Data in a Common Phylogenetic Tree"],"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"}]},{"given":"Mira","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7053-4716","authenticated-orcid":false,"given":"Nikolai N.","family":"N\u00f8jgaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0025-3097","authenticated-orcid":false,"given":"David","family":"Schaller","sequence":"additional","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"}]}],"member":"297","published-online":{"date-parts":[[2021,11,23]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"i283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal, M.S., Alm, E.J., Kellis, M.: Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics 28, i283\u2013i291 (2012). https:\/\/doi.org\/10.1093\/bioinformatics\/bts225","journal-title":"Bioinformatics"},{"key":"5_CR2","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":"5_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.tcs.2005.10.033","volume":"351","author":"D Bryant","year":"2006","unstructured":"Bryant, D., Lagergren, J.: Compatibility of unrooted phylogenetic trees is FPT. Theor. Comput. Sci. 351, 296\u2013302 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2005.10.033","journal-title":"Theor. Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0168-9525(00)02005-9","volume":"16","author":"W Fitch","year":"2000","unstructured":"Fitch, W.: Homology: a personal view on some of the problems. Trends Genet. 16, 227\u2013231 (2000). https:\/\/doi.org\/10.1016\/S0168-9525(00)02005-9","journal-title":"Trends Genet."},{"issue":"5","key":"5_CR5","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(5), 1459\u20131491 (2018). https:\/\/doi.org\/10.1007\/s00285-018-1260-8","journal-title":"J. Math. Biol."},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s00285-020-01469-y","volume":"80","author":"M Gei\u00df","year":"2020","unstructured":"Gei\u00df, M., et al.: Best match graphs and reconciliation of gene trees with species trees. J. Math. Biol. 80(5), 1459\u20131495 (2020). https:\/\/doi.org\/10.1007\/s00285-020-01469-y","journal-title":"J. Math. Biol."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 338\u2013355 (1984). https:\/\/doi.org\/10.1137\/0213024","journal-title":"SIAM J. Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1186\/s13015-017-0114-z","volume":"12","author":"M Hellmuth","year":"2017","unstructured":"Hellmuth, M.: Biologically feasible gene trees, reconciliation maps and informative triples. Algorithms Mol. Biol. 12, 23 (2017). https:\/\/doi.org\/10.1186\/s13015-017-0114-z","journal-title":"Algorithms Mol. Biol."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00285-012-0525-x","volume":"66","author":"M Hellmuth","year":"2013","unstructured":"Hellmuth, M., Hernandez-Rosales, M., Huber, K.T., Moulton, V., Stadler, P.F., Wieseke, N.: Orthology relations, symbolic ultrametrics, and cographs. J. Math. Biol. 66, 399\u2013420 (2013). https:\/\/doi.org\/10.1007\/s00285-012-0525-x","journal-title":"J. Math. Biol."},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Hellmuth, M., Long, Y., Gei\u00df, M., Stadler, P.F.: A short note on undirected Fitch graphs. Art Discrete Appl. Math. 1, P1.08 (2018). https:\/\/doi.org\/10.26493\/2590-9770.1245.98c","DOI":"10.26493\/2590-9770.1245.98c"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Schaller, D., Stadler, P.F.: Compatibility of partitions, hierarchies, and split systems (2021, submitted). arXiv arXiv:2104.14146","DOI":"10.1016\/j.dam.2022.03.014"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.dam.2020.01.036","volume":"283","author":"M Hellmuth","year":"2020","unstructured":"Hellmuth, M., Seemann, C.R., Stadler, P.F.: Generalized Fitch graphs II: sets of binary relations that are explained by edge-labeled trees. Discrete Appl. Math. 283, 495\u2013511 (2020). https:\/\/doi.org\/10.1016\/j.dam.2020.01.036","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s00285-016-1084-3","volume":"75","author":"M Hellmuth","year":"2016","unstructured":"Hellmuth, M., Stadler, P.F., Wieseke, N.: The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations. J. Math. Biol. 75(1), 199\u2013237 (2016). https:\/\/doi.org\/10.1007\/s00285-016-1084-3","journal-title":"J. Math. Biol."},{"issue":"1","key":"5_CR14","first-page":"13","volume":"23","author":"M Hellmuth","year":"2021","unstructured":"Hellmuth, M., Seemann, C.R., Stadler, P.F.: Generalized Fitch graphs III: symmetrized Fitch maps and sets of symmetric binary relations that are explained by unrooted edge-labeled trees. Discrete Math. Theor. Comput. Sci 23(1), 13 (2021)","journal-title":"Discrete Math. Theor. Comput. Sci"},{"key":"5_CR15","unstructured":"Jones, M., Lafond, M., Scornavacca, C.: Consistency of orthology and paralogy constraints in the presence of gene transfers (2017). arXiv arXiv:1705.01240"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s13015-020-00175-0","volume":"15","author":"M Lafond","year":"2020","unstructured":"Lafond, M., Hellmuth, M.: Reconstruction of time-consistent species trees. Algorithms Mol. Biol. 15, 16 (2020). https:\/\/doi.org\/10.1186\/s13015-020-00175-0","journal-title":"Algorithms Mol. Biol."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/s13015-018-0121-8","volume":"13","author":"N N\u00f8jgaard","year":"2018","unstructured":"N\u00f8jgaard, N., Gei\u00df, M., Merkle, D., Stadler, P.F., Wieseke, N., Hellmuth, M.: Time-consistent reconciliation maps and forbidden time travel. Algorithms Mol. Biol. 13, 2 (2018). https:\/\/doi.org\/10.1186\/s13015-018-0121-8","journal-title":"Algorithms Mol. Biol."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Schaller, D., Hellmuth, M., Stadler, P.F.: A linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set (2021, submitted). arXiv arXiv:2107.00072","DOI":"10.1186\/s13015-021-00202-8"},{"key":"5_CR19","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh, A., Hallett, M., Lagergren, J.: Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans. Comput. Biol. Bioinform 8(2), 517\u2013535 (2011). https:\/\/doi.org\/10.1109\/TCBB.2010.14","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91814-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T01:05:44Z","timestamp":1699837544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91814-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030918132","9783030918149"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91814-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BSB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Bioinformatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wob2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bsb.sbc.org.br\/2021\/","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":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"10","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":"5","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":"36% - 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":"2.5","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":"1.5","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)"}}]}}