{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:28:03Z","timestamp":1742977683335,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031175305"},{"type":"electronic","value":"9783031175312"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-17531-2_7","type":"book-chapter","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T15:14:33Z","timestamp":1666106073000},"page":"79-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unified SAT-Solving for\u00a0Hard Problems of\u00a0Phylogenetic Network Construction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7469-5103","authenticated-orcid":false,"given":"Dan","family":"Gusfield","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6350-874X","authenticated-orcid":false,"given":"Hannah","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1080\/10635150500431197","volume":"55","author":"M Baroni","year":"2006","unstructured":"Baroni, M., Semple, C., Steel, M.: Hybrids in real time. Syst. Biol. 55, 46\u201356 (2006)","journal-title":"Syst. Biol."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-02777-2_3","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"ML Bonet","year":"2009","unstructured":"Bonet, M.L., John, K.S.: Efficiently calculating evolutionary tree measures using SAT. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 4\u201317. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_3"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M Bordewich","year":"2005","unstructured":"Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Comb. 8, 409\u2013423 (2005). https:\/\/doi.org\/10.1007\/s00026-004-0229-z","journal-title":"Ann. Comb."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-42266-0_6","volume-title":"Algorithms for Computational Biology","author":"H Brown","year":"2020","unstructured":"Brown, H., Zuo, L., Gusfield, D.: Comparing integer linear programming to SAT-solving for hard problems in computational and systems biology. In: Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A., Wheeler, T. (eds.) AlCoB 2020. LNCS, vol. 12099, pp. 63\u201376. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-42266-0_6"},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9432.001.0001","volume-title":"ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks","author":"D Gusfield","year":"2014","unstructured":"Gusfield, D.: ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks. MIT Press, Cambridge (2014)"},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781108377737","volume-title":"Integer Linear Programming in Computational and Systems Biology: An Entry-level Text","author":"D Gusfield","year":"2019","unstructured":"Gusfield, D.: Integer Linear Programming in Computational and Systems Biology: An Entry-level Text. Cambridge University Press, Cambridge (2019)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/bioinformatics\/18.2.337","volume":"18","author":"R Hudson","year":"2002","unstructured":"Hudson, R.: Generating samples under the wright-fisher neutral model of genetic variation. Bioinformatics 18(2), 337\u2013338 (2002)","journal-title":"Bioinformatics"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511974076","volume-title":"Phylogenetic Networks","author":"D Huson","year":"2010","unstructured":"Huson, D., Rupp, R., Scornavacca, C.: Phylogenetic Networks. Cambridge University Press, Cambridge (2010)"},{"issue":"19","key":"7_CR9","doi-asserted-by":"publisher","first-page":"3277","DOI":"10.1093\/bioinformatics\/btab351","volume":"37","author":"A Ignatieva","year":"2021","unstructured":"Ignatieva, A., Lyngs\u00f8, R., Jenkins, P., Hein, J.: KwARG: parsimonious reconstruction of ancestral recombination graphs with recurrent mutation. Bioinformatics 37(19), 3277\u20133284 (2021)","journal-title":"Bioinformatics"},{"key":"7_CR10","unstructured":"Matsieva, J.: Optimization techniques for phylogenetics. PhD thesis, University of California, Davis, Department of Computer Science (2019)"},{"key":"7_CR11","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2013","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, Boston (2013)","edition":"3"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Song, Y.S., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of needed recombinations in the evolution of biological sequences. Bioinformatics, 21, i413\u2013i422 (2005). Bioinformatics Suppl. 1, Proceedings of ISMB 2005","DOI":"10.1093\/bioinformatics\/bti1033"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-21233-3_11","volume-title":"Algorithms for Computational Biology","author":"V Ulyantsev","year":"2015","unstructured":"Ulyantsev, V., Melnik, M.: Constructing parsimonious hybridization networks from multiple phylogenetic trees using a SAT-solver. In: Dediu, A.-H., Hern\u00e1ndez-Quiroz, F., Mart\u00edn-Vide, C., Rosenblueth, D.A. (eds.) AlCoB 2015. LNCS, vol. 9199, pp. 141\u2013153. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21233-3_11"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1089\/cmb.2013.0072","volume":"20","author":"Y Wu","year":"2013","unstructured":"Wu, Y.: An algorithm for constructing parsimonious hybridization networks with multiple phylogentic trees. J. Comput. Biol. 20, 792\u2013804 (2013)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Computational Advances in Bio and Medical Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17531-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T15:15:51Z","timestamp":1666106151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17531-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031175305","9783031175312"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17531-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCABS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Advances in Bio and Medical Sciences","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":"16 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccabs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccabs.engr.uconn.edu\/","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":"17","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":"13","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":"76% - 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","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.3","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)"}}]}}