{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:45:54Z","timestamp":1740185154857,"version":"3.37.3"},"reference-count":10,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T00:00:00Z","timestamp":1581465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"LabEx BASC","award":["ANR-11-LABX-0034"],"award-info":[{"award-number":["ANR-11-LABX-0034"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DEB 16-55607"],"award-info":[{"award-number":["DEB 16-55607"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Mod\u00e9lisation Math\u00e9matique et Biodiversit\u00e9"},{"name":"Mission for Interdisciplinarity"},{"name":"Institute for the Diversity, Ecology and Evolution of the Living World"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>As the density of sampled population increases, especially as studies incorporate aspects of the spatial landscape to study evolutionary processes, efficient simulation of genetic data under the coalescent becomes a primary challenge. Beyond the computational demands, coalescence-based simulation strategies have to be reconsidered because traditional assumptions about the dynamics of coalescing lineages within local populations may be violated (e.g. more than two daughter lineages may coalesce to a parent at low population densities). Specifically, to efficiently assign n lineages to m parents, the order relation between n and m strongly affects the relevant algorithm for the coalescent simulator (e.g. only when n&amp;lt;2m, it is reasonable to assume that two lineages, at most, can be assigned to the same parent). Controlling the details of the simulation model as a function of n and m is then crucial to represent accurately and efficiently the assignment process, but current implementations make it difficult to switch between different types of lineage mergers at run-time or even compile-time.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>With the described occupancy spectrum and algorithm that generates the support of the joint probability distribution of the occupancy spectrum; computation is much faster than realizing the whole assignment process under the coalescent. Using general definitions of lineage merges, which also makes the codebase reusable, we implement several variants of coalescent mergers, including an approximation where low probability spectrums are discarded. Comparison of runtimes and performance of the different C++ highly reusable coalescence mergers (binary, multiple, hybrids) are given, and we illustrate their potential utility with example applications.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>All components are integrated into Quetzal, an open-source C++ library for coalescence available at https:\/\/becheler.github.io\/pages\/quetzal.html.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btaa090","type":"journal-article","created":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T20:10:04Z","timestamp":1580847004000},"page":"3279-3280","source":"Crossref","is-referenced-by-count":1,"title":["Occupancy spectrum distribution: application for coalescence simulation with generic mergers"],"prefix":"10.1093","volume":"36","author":[{"given":"Arnaud","family":"Becheler","sequence":"first","affiliation":[{"name":"Department of Ecology and Evolutionary Biology , University of Michigan, Ann Arbor, MI 48109-1085, USA"}]},{"given":"L Lacey","family":"Knowles","sequence":"additional","affiliation":[{"name":"Department of Ecology and Evolutionary Biology , University of Michigan, Ann Arbor, MI 48109-1085, USA"}]}],"member":"286","published-online":{"date-parts":[[2020,2,12]]},"reference":[{"key":"2023020108352462100_btaa090-B1","doi-asserted-by":"crossref","first-page":"2385","DOI":"10.1073\/pnas.1322709111","article-title":"Distortion of genealogical properties when the sample is very large","volume":"111","author":"Bhaskar","year":"2014","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2023020108352462100_btaa090-B2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1046\/j.1471-8286.2003.00582.x","article-title":"SPLATCHE: a program to simulate genetic diversity taking into account environmental heterogeneity: PROGRAM NOTE","volume":"4","author":"Currat","year":"2004","journal-title":"Mol. Ecol. Notes"},{"key":"2023020108352462100_btaa090-B3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.tpb.2005.11.005","article-title":"Exact coalescent for the Wright\u2013Fisher model","volume":"69","author":"Fu","year":"2006","journal-title":"Theor. Popul. Biol"},{"year":"1977","author":"Johnson","key":"2023020108352462100_btaa090-B4"},{"key":"2023020108352462100_btaa090-B5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1017\/S0021900200034446","article-title":"On the genealogy of large populations","volume":"19","author":"Kingman","year":"1982","journal-title":"J. Appl. Prob"},{"key":"2023020108352462100_btaa090-B6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/356635.356640","article-title":"Structured programming with go to statements","volume":"6","author":"Knuth","year":"1974","journal-title":"ACM Comput. Surv"},{"key":"2023020108352462100_btaa090-B7","article-title":"Coupling Wright\u2013Fisher and coalescent dynamics for realistic simulation of population-scale datasets","author":"Nelson","year":"2019","journal-title":"BioRxiv"},{"key":"2023020108352462100_btaa090-B8","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1111\/mec.12755","article-title":"Coalescence 2.0: a multiple branching of recent theoretical developments and their applications","volume":"23","author":"Tellier","year":"2014","journal-title":"Mol. Ecol"},{"year":"1939","author":"Von Mises","key":"2023020108352462100_btaa090-B9"},{"key":"2023020108352462100_btaa090-B10","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1534\/genetics.111.135574","article-title":"Gene genealogies within a fixed pedigree, and the robustness of Kingman\u2019s coalescent","volume":"190","author":"Wakeley","year":"2012","journal-title":"Genetics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btaa090\/32889611\/btaa090.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/36\/10\/3279\/48991028\/bioinformatics_36_10_3279.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/36\/10\/3279\/48991028\/bioinformatics_36_10_3279.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T19:49:29Z","timestamp":1675280969000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/36\/10\/3279\/5734642"}},"subtitle":[],"editor":[{"given":"Russell","family":"Schwartz","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,2,12]]},"references-count":10,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,5,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btaa090","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"type":"print","value":"1367-4803"},{"type":"electronic","value":"1367-4811"}],"subject":[],"published-other":{"date-parts":[[2020,5,15]]},"published":{"date-parts":[[2020,2,12]]}}}