{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:22Z","timestamp":1750220722119,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"name":"NSF","award":["IIS-1751399"],"award-info":[{"award-number":["IIS-1751399"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,9,21]]},"DOI":"10.1145\/3388440.3412474","type":"proceedings-article","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T12:43:43Z","timestamp":1605012223000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Integer Linear Programming Solution for the Most Parsimonious Reconciliation Problem under the Duplication-Loss-Coalescence Model"],"prefix":"10.1145","author":[{"given":"Morgan","family":"Carothers","sequence":"first","affiliation":[{"name":"Department of Computer Science, Harvey Mudd College, Claremont, California"}]},{"given":"Joseph","family":"Gardi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Harvey Mudd College"}]},{"given":"Gianluca","family":"Gross","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Pennsylvania, Philadelphia, Pennsylvania"}]},{"given":"Tatsuki","family":"Kuze","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Harvey Mudd College"}]},{"given":"Nuo","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Harvey Mudd College"}]},{"given":"Fiona","family":"Plunkett","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Harvey Mudd College"}]},{"given":"Julia","family":"Qian","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Harvey Mudd College"}]},{"given":"Yi-Chieh","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Harvey Mudd College"}]}],"member":"320","published-online":{"date-parts":[[2020,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. Algorithm Mol Biol 12, 6","author":"Bork Daniel","year":"2017","unstructured":"Daniel Bork , Ricson Cheng , Jincheng Wang , Jean Sung , and Ran Libeskind-Hadas . 2017. On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. Algorithm Mol Biol 12, 6 ( 2017 ). https:\/\/doi.org\/10.1186\/s13015-017-0098-8 Daniel Bork, Ricson Cheng, Jincheng Wang, Jean Sung, and Ran Libeskind-Hadas. 2017. On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. Algorithm Mol Biol 12, 6 (2017). https:\/\/doi.org\/10.1186\/s13015-017-0098-8"},{"key":"e_1_3_2_1_2_1","unstructured":"Bastien Boussau and Celine Scornavacca. 2020. Phylogenetics in the Genomic Era. No commercial publisher | Authors open access book Chapter Reconciling Gene trees with Species Trees 3.2:1--3.2:23.  Bastien Boussau and Celine Scornavacca. 2020. Phylogenetics in the Genomic Era. No commercial publisher | Authors open access book Chapter Reconciling Gene trees with Species Trees 3.2:1--3.2:23."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2017.08.008"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-S1-S14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"International Business Machines Corporation. 2019. IBM ILOG CPLEX Optimization Studio CPLEX User's Manual Version 12 Release 9.  International Business Machines Corporation. 2019. IBM ILOG CPLEX Optimization Studio CPLEX User's Manual Version 12 Release 9.","DOI":"10.1007\/978-3-662-62185-1_2"},{"key":"e_1_3_2_1_6_1","volume-title":"Lateral gene transfer in eukaryotes: tip of the iceberg or of the ice cube? BMC Biology 14 (Nov. 18","author":"Danchin Etienne G. J.","year":"2016","unstructured":"Etienne G. J. Danchin . 2016. Lateral gene transfer in eukaryotes: tip of the iceberg or of the ice cube? BMC Biology 14 (Nov. 18 2016 ). https:\/\/doi.org\/10.1186\/s12915--016--0330-x Etienne G. J. Danchin. 2016. Lateral gene transfer in eukaryotes: tip of the iceberg or of the ice cube? BMC Biology 14 (Nov. 18 2016). https:\/\/doi.org\/10.1186\/s12915--016--0330-x"},{"key":"e_1_3_2_1_7_1","volume-title":"Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, and Yi-Chieh Wu.","author":"Du Haoxing","year":"2019","unstructured":"Haoxing Du , Yi Sheng Ong , Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, and Yi-Chieh Wu. 2019 . Multiple Optimal Reconciliations under the Duplication-Loss-Coalescence Model. IEEE\/ACM Transactions on Computational Biology and Bioinformatics ( 2019), 1--1. https:\/\/doi.org\/10.1109\/TCBB.2019.2922337 Haoxing Du, Yi Sheng Ong, Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, and Yi-Chieh Wu. 2019. Multiple Optimal Reconciliations under the Duplication-Loss-Coalescence Model. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (2019), 1--1. https:\/\/doi.org\/10.1109\/TCBB.2019.2922337"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-015-0721-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-019-1832-y"},{"key":"e_1_3_2_1_10_1","first-page":"132","article-title":"Fitting the Gene Lineage into its Species Lineage, a Parsimony Strategy Illustrated by Cladograms Constructed from Globin Sequences","volume":"28","author":"Goodman Morris","year":"1979","unstructured":"Morris Goodman , John Czelusniak , G. William Moore , A.E. Romero-Herrera , and Genji Matsuda . 1979 . Fitting the Gene Lineage into its Species Lineage, a Parsimony Strategy Illustrated by Cladograms Constructed from Globin Sequences . SystZool 28 , 2 (1979), 132 -- 163 . Morris Goodman, John Czelusniak, G. William Moore, A.E. Romero-Herrera, and Genji Matsuda. 1979. Fitting the Gene Lineage into its Species Lineage, a Parsimony Strategy Illustrated by Cladograms Constructed from Globin Sequences. SystZool 28, 2 (1979), 132--163.","journal-title":"SystZool"},{"volume-title":"Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics. Association for Computing Machinery","author":"Li Lei","key":"e_1_3_2_1_11_1","unstructured":"Lei Li and Mukul S. Bansal . 2018. An Integer Linear Programming Solution for the Domain-Gene-Species Reconciliation Problem . In Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics. Association for Computing Machinery , Washington, DC, USA, 386\u00e2\u0102\u015e397. https:\/\/doi.org\/10.1145\/3233547.3233603 Lei Li and Mukul S. Bansal. 2018. An Integer Linear Programming Solution for the Domain-Gene-Species Reconciliation Problem. In Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics. Association for Computing Machinery, Washington, DC, USA, 386\u00e2\u0102\u015e397. https:\/\/doi.org\/10.1145\/3233547.3233603"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2846253"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0084"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.471.0057"},{"key":"e_1_3_2_1_15_1","series-title":"SIAM J Comput 30 (Aug","volume-title":"From Gene Trees to Species Trees","author":"Ma Bin","year":"2000","unstructured":"Bin Ma , Ming Li , and Louxin Zhang . 2000. From Gene Trees to Species Trees . SIAM J Comput 30 (Aug . 2000 ), 729--752. Bin Ma, Ming Li, and Louxin Zhang. 2000. From Gene Trees to Species Trees. SIAM J Comput 30 (Aug. 2000), 729--752."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/46.3.523"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/syv082"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-019-3206-6"},{"key":"e_1_3_2_1_19_1","volume-title":"PuLP: A Linear Programming Toolkit for Python. (Sept. 5","author":"Mitchell Stuart","year":"2011","unstructured":"Stuart Mitchell , Michael O'Sullivan , and Iain Dunning . 2011. PuLP: A Linear Programming Toolkit for Python. (Sept. 5 2011 ). http:\/\/www.optimization-online.org\/DB_FILE\/2011\/09\/3178.pdf Stuart Mitchell, Michael O'Sullivan, and Iain Dunning. 2011. PuLP: A Linear Programming Toolkit for Python. (Sept. 5 2011). http:\/\/www.optimization-online.org\/DB_FILE\/2011\/09\/3178.pdf"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0240"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"Maps Between Trees and Cladistic Analysis of Historical Associations among Genes, Organisms, and Areas","volume":"43","author":"Page Roderic D.M.","year":"1994","unstructured":"Roderic D.M. Page . 1994 . Maps Between Trees and Cladistic Analysis of Historical Associations among Genes, Organisms, and Areas . Syst Biol 43 , 1 (March 1994), 58--77. https:\/\/doi.org\/10.1093\/sysbio\/43.1.58 Roderic D.M. Page. 1994. Maps Between Trees and Cladistic Analysis of Historical Associations among Genes, Organisms, and Areas. Syst Biol 43, 1 (March 1994), 58--77. https:\/\/doi.org\/10.1093\/sysbio\/43.1.58","journal-title":"Syst Biol"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.123901.111"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts386"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2010.14"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0092"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2430336"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.161968.113"}],"event":{"name":"BCB '20: 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"location":"Virtual Event USA","acronym":"BCB '20"},"container-title":["Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3388440.3412474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3388440.3412474","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3388440.3412474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:30Z","timestamp":1750199610000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3388440.3412474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,21]]},"references-count":27,"alternative-id":["10.1145\/3388440.3412474","10.1145\/3388440"],"URL":"https:\/\/doi.org\/10.1145\/3388440.3412474","relation":{},"subject":[],"published":{"date-parts":[[2020,9,21]]},"assertion":[{"value":"2020-11-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}