{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T06:51:25Z","timestamp":1753685485028,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"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-83508-8_13","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"172-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incomplete Directed Perfect Phylogeny in\u00a0Linear Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6647-088X","authenticated-orcid":false,"given":"Giulia","family":"Bernardini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7289-4988","authenticated-orcid":false,"given":"Paola","family":"Bonizzoni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6993-5440","authenticated-orcid":false,"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"7","key":"13_CR1","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1101\/gr.3493405","volume":"15","author":"A Bashir","year":"2005","unstructured":"Bashir, A., Ye, C., Price, A.L., Bafna, V.: Orthologous repeats and mammalian phylogenetic inference. Genome Res. 15(7), 998\u20131006 (2005)","journal-title":"Genome Res."},{"issue":"1\u20132","key":"13_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(98)00342-9","volume":"244","author":"HL Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Fellows, M.R., Hallett, M.T., Wareham, H.T., Warnow, T.J.: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theoret. Comput. Sci. 244(1\u20132), 167\u2013188 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2012.05.035","volume":"454","author":"P Bonizzoni","year":"2012","unstructured":"Bonizzoni, P., Braghin, C., Dondi, R., Trucco, G.: The binary perfect phylogeny with persistent characters. Theoret. Comput. Sci. 454, 51\u201363 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bonizzoni, P., Ciccolella, S., Della Vedova, G., Soto, M.: Beyond perfect phylogeny: Multisample phylogeny reconstruction via ilp. In: 8th ACM-BCB, pp. 1\u201310 (2017)","DOI":"10.1145\/3107411.3107441"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Camin, J.H., Sokal, R.R.: A method for deducing branching sequences in phylogeny. Evolution, pp. 311\u2013326 (1965)","DOI":"10.1111\/j.1558-5646.1965.tb01722.x"},{"issue":"17","key":"13_CR6","doi-asserted-by":"publisher","first-page":"i671","DOI":"10.1093\/bioinformatics\/bty589","volume":"34","author":"M El-Kebir","year":"2018","unstructured":"El-Kebir, M.: Sphyr: tumor phylogeny estimation from single-cell sequencing data under loss and error. Bioinformatics 34(17), i671\u2013i679 (2018)","journal-title":"Bioinformatics"},{"issue":"5","key":"13_CR7","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification-a technique for speeding up dynamic graph algorithms. J. ACM 44(5), 669\u2013696 (1997)","journal-title":"J. ACM"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322234.322235","volume":"28","author":"S Even","year":"1981","unstructured":"Even, S., Shiloach, Y.: An on-line edge-deletion problem. J. ACM 28(1), 1\u20134 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3390\/a12030053","volume":"12","author":"D Fern\u00e1ndez-Baca","year":"2019","unstructured":"Fern\u00e1ndez-Baca, D., Liu, L.: Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: An experimental study. Algorithms 12(3), 53 (2019)","journal-title":"Algorithms"},{"key":"13_CR10","unstructured":"Gibb, D., Kapron, B., King, V., Thorn, N.: Dynamic graph connectivity with improved worst case update time and sublinear space. arXiv:1509.06464 (2015)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21(1), 19\u201328 (1991)","journal-title":"Networks"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Persistent phylogeny: a galled-tree and integer linear programming approach. In: 6th ACM-BCB, pp. 443\u2013451 (2015)","DOI":"10.1145\/2808719.2808765"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Halperin, E., Karp, R.M.: Perfect phylogeny and haplotype assignment. In: Proceedings of the Eighth Annual International Conference on Resaerch in Computational Molecular Biology, pp. 10\u201319 (2004)","DOI":"10.1145\/974614.974617"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"MR Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., De Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Huang, S.E., Huang, D., Kopelowitz, T., Pettie, S.: Fully dynamic connectivity in $$O(\\log n(\\log \\log n)^2)$$ amortized expected time. In: 28th SODA, pp. 510\u2013520. SIAM (2017)","DOI":"10.1137\/1.9781611974782.32"},{"issue":"02","key":"13_CR17","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0219720005001090","volume":"3","author":"G Kimmel","year":"2005","unstructured":"Kimmel, G., Shamir, R.: The incomplete perfect phylogeny haplotype problem. J. Bioinform. Comput. Biol. 3(02), 359\u2013384 (2005)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"5","key":"13_CR18","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1109\/TCBB.2014.2316005","volume":"11","author":"B Kirkpatrick","year":"2014","unstructured":"Kirkpatrick, B., Stevens, K.: Perfect phylogeny problems with missing values. IEEE\/ACM Trans. Comput. Biol. Bioinf. 11(5), 928\u2013941 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"18","key":"13_CR19","doi-asserted-by":"publisher","first-page":"10261","DOI":"10.1073\/pnas.96.18.10261","volume":"96","author":"M Nikaido","year":"1999","unstructured":"Nikaido, M., Rooney, A.P., Okada, N.: Phylogenetic relationships among cetartiodactyls based on insertions of short and long interpersed elements: hippopotamuses are the closest extant relatives of whales. Proc. Natl. Acad. Sci. 96(18), 10261\u201310266 (1999)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1137\/S0097539702406510","volume":"33","author":"I Pe\u2019er","year":"2004","unstructured":"Pe\u2019er, I., Pupko, T., Shamir, R., Sharan, R.: Incomplete directed perfect phylogeny. SIAM J. Comput. 33(3), 590\u2013607 (2004)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.cels.2020.04.001","volume":"10","author":"G Satas","year":"2020","unstructured":"Satas, G., Zaccaria, S., Mon, G., Raphael, B.J.: Scarlet: Single-cell tumor phylogeny inference with copy-number constrained mutation losses. Cell Syst. 10(4), 323\u2013332 (2020)","journal-title":"Cell Syst."},{"issue":"4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/TCBB.2007.70218","volume":"5","author":"RV Satya","year":"2008","unstructured":"Satya, R.V., Mukherjee, A.: The undirected incomplete perfect phylogeny problem. IEEE\/ACM Trans. Comput. Biol. Bioinf. 5(4), 618\u2013629 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach, Y., Vishkin, U.: An $$o(\\log n)$$ parallel connectivity algorithm. J. Algorithms 3(1), 57\u201367 (1982)","journal-title":"J. Algorithms"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Stevens, K., Gusfield, D.: Reducing multi-state to binary perfect phylogeny with applications to missing, removable, inserted, and deleted data. In: Moulton, V., Singh, M. (eds.) Algorithms in Bioinformatics. WABI 2010. Lecture Notes in Computer Science, vol. 6293. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15294-8_23","DOI":"10.1007\/978-3-642-15294-8_23"},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/jagm.1999.1033","volume":"33","author":"M Thorup","year":"1999","unstructured":"Thorup, M.: Decremental dynamic connectivity. J. Algorithms 33(2), 229\u2013243 (1999)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:26:29Z","timestamp":1645183589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_13","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":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","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":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}