pith. machine review for the scientific record. sign in

arxiv: 2601.09634 · v3 · submitted 2026-01-14 · 🧬 q-bio.PE

Recognition: no theorem link

Human Ancestries Simulation and Inference: a Review of Ancestral Recombination Graph-Based Approaches

Patrick Fournier , Fabrice Larribe
Authors on Pith no claims yet

Pith reviewed 2026-05-16 14:07 UTC · model grok-4.3

classification 🧬 q-bio.PE
keywords ancestral recombination graphcoalescent simulationancestry inferencepopulation geneticshuman evolutionrecombinationgenealogical inferenceARG sampler
0
0 comments X

The pith

Computational barriers to ancestral recombination graphs have been largely cleared over two decades, producing more capable simulation and inference software for human ancestries even as inference accuracy stays challenging.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This review surveys ARG samplers developed over the past three decades and argues that earlier computational obstacles have been substantially reduced. The result is a set of increasingly flexible and scalable tools for simulating and inferring genealogies that include recombination. The authors evaluate these tools on performance, usability, and how well their underlying models match biological processes. A reader would care because ancestry reconstruction underpins much of modern population genetics and evolutionary inference from genomic data. The paper supplies a technical map aimed at researchers who want to build the next generation of coalescent-with-recombination samplers.

Core claim

The central claim is that many computational difficulties in using ancestral recombination graphs have been overcome in the past two decades, which have consequently seen the development of increasingly sophisticated ARG simulation and inference software, although challenges remain especially in the area of ancestry inference.

What carries the argument

The ancestral recombination graph (ARG), a model that records the full genealogical history of a sample while explicitly tracking recombination breakpoints and the resulting mosaic structure of chromosomes.

If this is right

  • Researchers now have a documented range of ARG-based simulators and inferrers that trade off speed, memory use, and model realism at different data scales.
  • New sampler development can focus on the remaining inference bottlenecks rather than re-solving earlier scalability problems.
  • Software that scores well on biological realism can be used with greater that the simulated histories match observable patterns in real genomes.
  • The compiled links to code and documentation lower the barrier for testing or extending existing ARG tools.
  • Continued progress in inference methods will be required before ARG-based approaches become routine for very large cohorts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Wider adoption of these ARG tools could improve estimates of historical population sizes and migration events in human evolutionary studies.
  • The review's emphasis on usability suggests that integration with existing genomic pipelines will determine which samplers become standard practice.
  • If inference accuracy improves, ARG methods may complement or replace simpler tree-based approximations in demographic modeling.

Load-bearing premise

The review assumes that the selected set of ARG samplers from the past three decades is representative of the most relevant work and that the chosen evaluation criteria of performance, usability, and biological realism are sufficient to guide new development.

What would settle it

A systematic benchmark on current large-scale whole-genome datasets that shows the reviewed software packages remain too slow or too inaccurate for routine ancestry inference would undermine the claim that the main computational difficulties have been overcome.

Figures

Figures reproduced from arXiv: 2601.09634 by Fabrice Larribe, Patrick Fournier.

Figure 1
Figure 1. Figure 1: Examples of coalescence events. composition of the sample. Consequently, the choice of disregarding a particular type is made primarily, if not solely, for performance reasons. Disregarding type A events has never been done in practice. There are no known performance gains to be achieved in this way. On the other hand, denying type B events led to the now famous sequential Markov coalescent (SMC). This alg… view at source ↗
Figure 2
Figure 2. Figure 2: Examples of recombination events. within ancestral material, and of type 2 otherwise. Types 3 and 4 events correspond to cases in which ancestral material is present only to the left or the right side of the position, respectively. An event positioned on a sequence devoid of ancestral material is of type 5. Unlike coalescence events, some types of recombination events have no bearing on the sample. The out… view at source ↗
read the original abstract

There is little debate about the importance of the ancestral recombination graph in population genetics. An important theoretical tool, the main obstacle to its widespread usage is the computational cost required to match the ever-increasing scale of the data being analyzed. Many of these difficulties have been overcome in the past two decades, which have consequently seen the development of increasingly sophisticated ARG simulation and inference software. Nonetheless, challenges remain, especially in the area of ancestry inference. This paper is a comprehensive review of ARG samplers that have emerged in the past three decades to meet the need for scalable and flexible ancestry simulation and inference solutions. It specifically focuses on their performance, usability, and the biological realism of the underlying algorithm, and aims primarily to provide a technical overview of the field for researchers seeking to write their own coalescent-with-recombination sampler. As a complement to this article, we have compiled links to software, source code and documentation and made them available at https://patrickfournier.ca/arg-software-review/graph/.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The manuscript is a review of ancestral recombination graph (ARG) simulation and inference methods developed over the past three decades. It evaluates selected samplers according to performance, usability, and biological realism, with the primary aim of providing a technical guide for researchers developing new coalescent-with-recombination samplers. The central narrative states that computational obstacles to ARG use have been substantially addressed, yielding increasingly sophisticated software, while ancestry inference remains a key challenge. A companion website compiling software links, source code, and documentation is provided as a practical resource.

Significance. If the assessments of individual tools are accurate and the selection representative, the review would offer a useful consolidation of the ARG literature for population geneticists. The explicit focus on practical criteria (performance, usability, biological realism) and the provision of a checkable software compilation distinguish it from a purely bibliographic survey and could help new developers avoid reinventing solved problems.

major comments (2)
  1. [Introduction] The manuscript states that the reviewed samplers are 'representative of the most relevant work' (Introduction), yet no explicit inclusion/exclusion criteria or search strategy is provided. This makes it impossible to assess whether important recent contributions (e.g., post-2020 scalable inference methods) have been omitted, weakening the claim that the set forms a reliable guide for new sampler development.
  2. [§1] The central claim that 'many of these difficulties have been overcome' (Abstract and §1) rests on qualitative descriptions of individual tools rather than any cross-tool quantitative comparison. A summary table reporting runtime scaling, memory usage, or accuracy on standardized benchmarks (e.g., 10^4 vs 10^5 samples) would be required to substantiate the narrative of substantial progress.
minor comments (3)
  1. [Abstract] The companion website URL is given but no snapshot or archive link is provided; this risks link rot and reduces long-term utility of the resource.
  2. [§2] Notation for ARG components (e.g., 'ARG', 'coalescent-with-recombination') is used inconsistently between the abstract and early sections; a short glossary or consistent definition on first use would improve readability.
  3. [§3] Several software descriptions mention 'biological realism' without specifying which demographic or selection features are modeled; adding a column or paragraph clarifying supported features (e.g., variable recombination rates, selection) would strengthen the evaluation framework.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive review and recommendation of minor revision. The comments highlight opportunities to improve transparency and support for our central claims, and we address each point below.

read point-by-point responses

  1. Referee: [Introduction] The manuscript states that the reviewed samplers are 'representative of the most relevant work' (Introduction), yet no explicit inclusion/exclusion criteria or search strategy is provided. This makes it impossible to assess whether important recent contributions (e.g., post-2020 scalable inference methods) have been omitted, weakening the claim that the set forms a reliable guide for new sampler development.

    Authors: We agree that explicit inclusion/exclusion criteria and a clear search strategy would strengthen the manuscript and make the selection process more transparent. In the revised version we will add a dedicated paragraph in the Introduction that states our criteria: methods were selected if they (i) explicitly model the ARG or coalescent with recombination, (ii) provide publicly available software, and (iii) represent key advances in scalability or biological realism over the past three decades. We will also describe the literature search approach (citation tracking of foundational papers plus targeted review of post-2015 developments). This revision will allow readers to evaluate whether important post-2020 methods were omitted and will reinforce the manuscript's utility as a technical guide. revision: yes

  2. Referee: [§1] The central claim that 'many of these difficulties have been overcome' (Abstract and §1) rests on qualitative descriptions of individual tools rather than any cross-tool quantitative comparison. A summary table reporting runtime scaling, memory usage, or accuracy on standardized benchmarks (e.g., 10^4 vs 10^5 samples) would be required to substantiate the narrative of substantial progress.

    Authors: The referee is correct that our assessment relies on qualitative synthesis rather than new cross-tool benchmarks. Performing standardized quantitative comparisons would require re-implementing and re-testing every method under identical conditions, which exceeds the scope of a review. Nevertheless, to better substantiate the claim of progress we will add a summary table that compiles the performance metrics (runtime scaling, memory usage, and accuracy where reported) directly from the original publications. The table will also note the sample sizes and hardware used in each study, allowing readers to gauge relative advances. This constitutes a partial revision, as full standardized re-benchmarking is not feasible here. revision: partial

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper is a literature review of ARG samplers over three decades. It contains no original derivations, equations, fitted parameters, or predictions that could reduce to self-defined inputs. All claims are descriptive summaries of external prior work, with evaluation criteria (performance, usability, biological realism) presented as practical guidance rather than derived results. The software compilation link serves as an external, checkable complement. No load-bearing self-citation chains or ansatzes appear.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

As a review the paper introduces no new free parameters, axioms, or invented entities; it summarizes methods already present in the cited literature.

pith-pipeline@v0.9.0 · 5474 in / 1133 out tokens · 69702 ms · 2026-05-16T14:07:38.721895+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

99 extracted references · 99 canonical work pages

  1. [1]

    Inference of ancestral recombination graphs using argweaver, pages 231–266

    Melissa Hubisz and Adam Siepel. Inference of ancestral recombination graphs using argweaver, pages 231–266. Springer US, 2020. ISBN 9781071601990. doi: 10.1007/978-1 -0716-0199-0_10

    work page doi:10.1007/978-1 2020

  2. [2]

    Simulation of genomes: a r eview

    Antonio Carvajal-Rodriguez. Simulation of genomes: a r eview. Current Genomics, 9(3):155–159, May 2008. ISSN 1389-2029. doi: 10.2174/138920208784340759

    work page doi:10.2174/138920208784340759 2008

  3. [3]

    Y oufang Liu, Georgios Athanasiadis, and Michael E. Weal e. A survey of genetic simulation software for population and epidemiological studies. Human Genomics , 3(1):79–86, 2008. ISSN 1479-7364. doi: 10.1186/1479-7364-3-1-79

    work page doi:10.1186/1479-7364-3-1-79 2008

  4. [4]

    Simulation of molecular data under diver se evolutionary scenarios

    Miguel Arenas. Simulation of molecular data under diver se evolutionary scenarios. PLoS Computational Biol- ogy, 8(5):e1002495, May 2012. ISSN 1553-7358. doi: 10.1371/jo urnal.pcbi.1002495

    work page doi:10.1371/jo 2012

  5. [5]

    Miller, Junying Zhang, David Herrin gton, and Y ue Wang

    Xiguo Y uan, David J. Miller, Junying Zhang, David Herrin gton, and Y ue Wang. An overview of population genetic data simulation. Journal of Computational Biology , 19(1):42–54, January 2012. ISSN 1557-8666. doi: 10.1089/cmb.2010.0188

    work page doi:10.1089/cmb.2010.0188 2012

  6. [6]

    Gaggiotti

    Sean Hoban, Giorgio Bertorelle, and Oscar E. Gaggiotti. Computer simulations: tools for population and evolutionary genetics. Nature Reviews Genetics , 13(2):110–122, January 2012. ISSN 1471-0064. doi: 10.1038/nrg3130

    work page doi:10.1038/nrg3130 2012

  7. [7]

    Critical asses sment of coalescent simulators in modeling recom- bination hotspots in genomic sequences

    Tao Y ang, Hong-Wen Deng, and Tianhua Niu. Critical asses sment of coalescent simulators in modeling recom- bination hotspots in genomic sequences. BMC Bioinformatics, 15(1):1–14, January 2014. ISSN 1471-2105. doi: 10.1186/1471-2105-15-3

    work page doi:10.1186/1471-2105-15-3 2014

  8. [8]

    Débora Y . C. Brandt, Christian D. Huber, Charleston W . K.Chiang, and Diego Ortega-Del V ecchyo. The promise of inferring the past using the ancestral recombination gra ph. Genome Biology and Evolution , 16(2), January

    work page

  9. [9]

    doi: 10.1093/gbe/evae005

    ISSN 1759-6653. doi: 10.1093/gbe/evae005

    work page doi:10.1093/gbe/evae005

  10. [10]

    V aughn, and Y un Deng

    Rasmus Nielsen, Andrew H. V aughn, and Y un Deng. Inferenc e and applications of ancestral recombina- tion graphs. Nature Reviews Genetics , 26(1):47–58, September 2024. ISSN 1471-0064. doi: 10.103 8/ s41576-024-00772-4

    work page 2024

  11. [11]

    Association mapping of complex diseases with ancestral recombination graphs: models and efficient algorithms

    Y ufeng Wu. Association mapping of complex diseases with ancestral recombination graphs: models and efficient algorithms. Journal of Computational Biology, 15(7):667–684, September 2008. ISSN 1557-8666. doi: 10.1 089/ cmb.2007.0116

    work page arXiv 2008

  12. [12]

    Wohns, and Jerome Kelleher

    Y an Wong, Anastasia Ignatieva, Jere Koskela, Gregor Go rjanc, Anthony W . Wohns, and Jerome Kelleher. A general and efficient representation of ancestral recombin ation graphs. Genetics, 228(1), July 2024. ISSN 1943-

    work page 2024

  13. [13]

    doi: 10.1093/genetics/iyae100

    work page doi:10.1093/genetics/iyae100

  14. [14]

    Lewanski, Michael C

    Alexander L. Lewanski, Michael C. Grundler, and Gideon S. Bradburd. The era of the arg: an introduction to ancestral recombination graphs and their significance in em pirical evolutionary genomics. PLOS Genetics , 20 (1):e1011110, January 2024. ISSN 1553-7404. doi: 10.1371/ journal.pgen.1011110

    work page 2024

  15. [15]

    Recombination as a point pr ocess along sequences

    Carsten Wiuf and Jotun Hein. Recombination as a point pr ocess along sequences. Theoretical Population Biology, 55(3):248–259, June 1999. ISSN 0040-5809. doi: 10.1006/t pbi.1998.1403

    work page doi:10.1006/t 1999

  16. [16]

    Gilean A. T. McV ean and Niall J. Cardin. Approximating t he coalescent with recombination. Philosophical Transactions of the Royal Society B: Biological Sciences , 360(1459):1387–1393, July 2005. ISSN 1471-2970. doi: 10.1098/rstb.2005.1673

    work page doi:10.1098/rstb.2005.1673 2005

  17. [17]

    Wilton, Shai Carmi, and Asger Hobolth

    Peter R. Wilton, Shai Carmi, and Asger Hobolth. The SMC’ is a highly accurate approximation to the ancestral recombination graph. Genetics, 200(1):343–355, March 2015. ISSN 1943-2631. doi: 10.1534 /genetics.114. 173898

    work page 2015

  18. [18]

    coalescent

    Paul Marjoram and Jeff D. Wall. Fast "coalescent" simul ation. BMC Genetics , 7(1):1–9, March 2006. ISSN 1471-2156. doi: 10.1186/1471-2156-7-16

    work page doi:10.1186/1471-2156-7-16 2006

  19. [19]

    Markov jump proce sses in modeling coalescent with recombination

    Xian Chen, Zhi-Ming Ma, and Ying Wang. Markov jump proce sses in modeling coalescent with recombination. The Annals of Statistics , 42(4), August 2014. ISSN 0090-5364. doi: 10.1214/14-aos1 227

    work page doi:10.1214/14-aos1 2014

  20. [20]

    Approximating the coalescent with recombination

    Niall Cardin. Approximating the coalescent with recombination . phdthesis, University of Oxford, 2007

    work page 2007

  21. [21]

    Eriksson, B

    A. Eriksson, B. Mahjani, and B. Mehlig. Sequential mark ov coalescent algorithms for population models with demographic structure. Theoretical Population Biology, 76(2):84–91, September 2009. ISSN 0040-5809. doi: 10.1016/j.tpb.2009.05.002

    work page doi:10.1016/j.tpb.2009.05.002 2009

  22. [22]

    Markovian approxi mation to the finite loci coalescent with recombination along multiple sequences

    Asger Hobolth and Jens Ledet Jensen. Markovian approxi mation to the finite loci coalescent with recombination along multiple sequences. Theoretical Population Biology, 98:48–58, December 2014. ISSN 0040-5809. doi: 10.1016/j.tpb.2014.01.002. 29 ARG Samplers Review A P REPRINT

    work page doi:10.1016/j.tpb.2014.01.002 2014

  23. [23]

    V . Shchur. Accuracy of the SMC’ approximation of struct ured coalescent. Lobachevskii Journal of Mathematics, 43(12):3626–3630, December 2022. ISSN 1818-9962. doi: 10. 1134/s1995080222150264

    work page 2022

  24. [24]

    A new method for modeling coalescent processes with recombination

    Ying Wang, Ying Zhou, Linfeng Li, Xian Chen, Y uting Liu, Zhi-Ming Ma, and Shuhua Xu. A new method for modeling coalescent processes with recombination. BMC Bioinformatics, 15(1), August 2014. ISSN 1471-2105. doi: 10.1186/1471-2105-15-273

    work page doi:10.1186/1471-2105-15-273 2014

  25. [25]

    Bayesian inference of ances- tral recombination graphs

    Ali Mahmoudi, Jere Koskela, Jerome Kelleher, Y ao-ban C han, and David Balding. Bayesian inference of ances- tral recombination graphs. PLOS Computational Biology , 18(3):e1009960, March 2022. ISSN 1553-7358. doi: 10.1371/journal.pcbi.1009960

    work page doi:10.1371/journal.pcbi.1009960 2022

  26. [26]

    Rasmussen, Melissa J

    Matthew D. Rasmussen, Melissa J. Hubisz, Ilan Gronau, a nd Adam Siepel. Genome-wide inference of ancestral recombination graphs. PLoS Genetics , 10(5):e1004342, May 2014. ISSN 1553-7404. doi: 10.1371/j ournal. pgen.1004342

    work page doi:10.1371/j 2014

  27. [27]

    The number of heterozygous nucleotide si tes maintained in a finite population due to steady flux of mutations

    Motoo Kimura. The number of heterozygous nucleotide si tes maintained in a finite population due to steady flux of mutations. Genetics, 61(4):893–903, April 1969. ISSN 1943-2631. doi: 10.1093/ genetics/61.4.893

    work page 1969

  28. [28]

    Richard R. Hudson. Properties of a neutral allele model with intragenic recombination. Theoretical Population Biology, 23(2):183–201, April 1983. ISSN 0040-5809. doi: 10.1016/ 0040-5809(83)90013-8

    work page 1983

  29. [29]

    Richard R. Hudson. Gene genealogies and the coalescent process. Oxford surveys in evolutionary biology , 7: 1–44, 1991

    work page 1991

  30. [30]

    Richard R. Hudson. Generating samples under a Wright-F isher neutral model of genetic variation. Bioinformat- ics, 18(2):337–338, February 2002. ISSN 1367-4803. doi: 10.10 93/bioinformatics/18.2.337

    work page 2002

  31. [31]

    The coalescent with gene co nversion

    Carsten Wiuf and Jotun Hein. The coalescent with gene co nversion. Genetics, 155(1):451–462, May 2000. ISSN 1943-2631. doi: 10.1093/genetics/155.1.451

    work page doi:10.1093/genetics/155.1.451 2000

  32. [32]

    A mechanism for gene conversion in fung i

    Robin Holliday. A mechanism for gene conversion in fung i. Genetics Research, 5(2):282–304, July 1964. ISSN 1469-5073. doi: 10.1017/s0016672300001233

    work page doi:10.1017/s0016672300001233 1964

  33. [33]

    Etheridge, and Gilean McV ea n

    Jerome Kelleher, Alison M. Etheridge, and Gilean McV ea n. Efficient coalescent simulation and genealogical analysis for large sample sizes. PLOS Computational Biology , 12(5):e1004842, May 2016. ISSN 1553-7358. doi: 10.1371/journal.pcbi.1004842

    work page doi:10.1371/journal.pcbi.1004842 2016

  34. [34]

    MSMS: a coalescen t simulation program including recombination, demographic structure and selection at a single locus

    Gregory Ewing and Joachim Hermisson. MSMS: a coalescen t simulation program including recombination, demographic structure and selection at a single locus. Bioinformatics, 26(16):2064–2065, June 2010. ISSN 1367-4803. doi: 10.1093/bioinformatics/btq322

    work page doi:10.1093/bioinformatics/btq322 2064

  35. [35]

    Sabeti, and Stephen F

    Ilya Shlyakhter, Pardis C. Sabeti, and Stephen F. Schaf fner. Cosi2: an efficient simulator of exact and ap- proximate coalescent with selection. Bioinformatics, 30(23):3427–3429, August 2014. ISSN 1367-4803. doi: 10.1093/bioinformatics/btu562

    work page doi:10.1093/bioinformatics/btu562 2014

  36. [36]

    Kern and Daniel R

    Andrew D. Kern and Daniel R. Schrider. Discoal: flexible coalescent simulations with selection. Bioinformatics, 32(24):3839–3841, August 2016. ISSN 1367-4811. doi: 10.10 93/bioinformatics/btw556

    work page 2016

  37. [37]

    Pennings and Joachim Hermisson

    Pleuni S. Pennings and Joachim Hermisson. Soft sweeps i i—molecular population genetics of adaptation from recurrent mutation or migration. Molecular Biology and Evolution , 23(5):1076–1084, March 2006. ISSN 0737-

    work page 2006

  38. [38]

    doi: 10.1093/molbev/msj117

    work page doi:10.1093/molbev/msj117

  39. [39]

    Zachary A. Szpiech. selscan 2.0: scanning for sweeps in unphased data. Bioinformatics, 40(1), January 2024. ISSN 1367-4811. doi: 10.1093/bioinformatics/btae006

    work page doi:10.1093/bioinformatics/btae006 2024

  40. [40]

    Ragsdale, Georgia Tsambos, Sha Zhu, Bjarki Eldon, E

    Franz Baumdicker, Gertjan Bisschop, Daniel Goldstein , Graham Gower, Aaron P . Ragsdale, Georgia Tsambos, Sha Zhu, Bjarki Eldon, E. Castedo Ellerman, Jared G. Gallowa y, Ariella L. Gladstein, Gregor Gorjanc, Bing Guo, Ben Jeffery, Warren W . Kretzschumar, Konrad Lohse, Michael Matschiner, Dominic Nelson, Nathaniel S. Pope, Consuelo D. Quinto-Cortés, Muril...

    work page

  41. [41]

    doi: 10.1093/genetics/iyab229

    ISSN 1943-2631. doi: 10.1093/genetics/iyab229

    work page doi:10.1093/genetics/iyab229 1943

  42. [42]

    Thornton, Jaime Ashander, an d Peter L

    Jerome Kelleher, Kevin R. Thornton, Jaime Ashander, an d Peter L. Ralph. Efficient pedigree recording for fast population genetics simulation. PLOS Computational Biology , 14(11):e1006581, November 2018. ISSN 1553-7358. doi: 10.1371/journal.pcbi.1006581

    work page doi:10.1371/journal.pcbi.1006581 2018

  43. [43]

    Kevin Ushey, J. J. Allaire, and Y uan Tang. reticulate: Interface to ‘Python’ , 2025. URL https://rstudio.github.io/reticulate. R package version 1.41.0, https://github.com/rstudio/r eticulate. 30 ARG Samplers Review A P REPRINT

    work page 2025

  44. [44]

    PLOS Computational Biology21, e1012101 (2025)

    Dominic Nelson, Jerome Kelleher, Aaron P . Ragsdale, Cl audia Moreau, Gil McV ean, and Simon Gravel. Ac- counting for long-range correlations in genome-wide simul ations of large cohorts. PLOS Genetics , 16(5): e1008619, May 2020. ISSN 1553-7404. doi: 10.1371/journal. pgen.1008619

    work page doi:10.1371/journal 2020

  45. [45]

    msHOT: modif ying Hudson’s ms simulator to incorporate crossover and gene conversion hotspots

    Garrett Hellenthal and Matthew Stephens. msHOT: modif ying Hudson’s ms simulator to incorporate crossover and gene conversion hotspots. Bioinformatics, 23(4):520–521, December 2006. ISSN 1367-4803. doi: 10.10 93/ bioinformatics/btl622

    work page 2006

  46. [46]

    Teshima and Hideki Innan

    Kosuke M. Teshima and Hideki Innan. Mbs: modifying Huds on’s ms software to generate samples of DNA sequences with a biallelic site under selection. BMC Bioinformatics , 10(1):1–4, May 2009. ISSN 1471-2105. doi: 10.1186/1471-2105-10-166

    work page doi:10.1186/1471-2105-10-166 2009

  47. [47]

    msPar: a parallel coale scent simulator

    Carlos Montemuiño, Antonio Espinosa, Juan-Carlos Mou re, Gonzalo V era-Rodríguez, Sebastián Ramos- Onsins, and Porfidio Hernández Budé. msPar: a parallel coale scent simulator. In Euro-Par 2013: Paral- lel Processing W orkshops, pages 321–330. Springer Berlin Heidelberg, 2014. ISBN 978 3642544200. doi: 10.1007/978-3-642-54420-0_32

    work page doi:10.1007/978-3-642-54420-0_32 2013

  48. [48]

    Moure, Go nzalo V era, Porfidio Hernández, and Sebastián Ramos-Onsins

    Carlos Montemuiño, Antonio Espinosa, Juan C. Moure, Go nzalo V era, Porfidio Hernández, and Sebastián Ramos-Onsins. Approaching long genomic regions and large r ecombination rates with msParSm as an alter- native to MaCS. Evolutionary Bioinformatics, 12, January 2016. ISSN 1176-9343. doi: 10.4137/ebo.s4026 8

    work page doi:10.4137/ebo.s4026 2016

  49. [49]

    Laurent Excoffier and Heidi E. L. Lischer. Arlequin suit e ver 3.5: a new series of programs to perform population genetics analyses under Linux and Windows. Molecular Ecology Resources, 10(3):564–567, April 2010. ISSN 1755-0998. doi: 10.1111/j.1755-0998.2010.02847.x

    work page doi:10.1111/j.1755-0998.2010.02847.x 2010

  50. [50]

    Simcoal 2.0: a pr ogram to simulate genomic diversity over large re- combining regions in a subdivided population with a complex history

    Guillaume Laval and Laurent Excoffier. Simcoal 2.0: a pr ogram to simulate genomic diversity over large re- combining regions in a subdivided population with a complex history. Bioinformatics, 20(15):2485–2487, April

    work page

  51. [51]

    doi: 10.1093/bioinformatics/bth26 4

    ISSN 1367-4803. doi: 10.1093/bioinformatics/bth26 4

    work page doi:10.1093/bioinformatics/bth26

  52. [52]

    Excoffier

    L. Excoffier. Computer note. simcoal: a general coalesc ent program for the simulation of molecular data in interconnected populations with arbitrary demography. Journal of Heredity , 91(6):506–509, November 2000. ISSN 1471-8505. doi: 10.1093/jhered/91.6.506

    work page doi:10.1093/jhered/91.6.506 2000

  53. [53]

    C. N. K. Anderson, U. Ramakrishnan, Y . L. Chan, and E. A. H adly. Serial simcoal: A population genetics model for data from multiple populations and points in time. Bioinformatics, 21(8):1733–1734, November 2004. ISSN 1460-2059. doi: 10.1093/bioinformatics/bti154

    work page doi:10.1093/bioinformatics/bti154 2004

  54. [54]

    fastsimcoal: a con tinuous-time coalescent simulator of genomic diversity under arbitrarily complex evolutionary scenarios

    Laurent Excoffier and Matthieu Foll. fastsimcoal: a con tinuous-time coalescent simulator of genomic diversity under arbitrarily complex evolutionary scenarios. Bioinformatics, 27(9):1332–1334, March 2011. ISSN 1367-

    work page 2011

  55. [55]

    doi: 10.1093/bioinformatics/btr124

    work page doi:10.1093/bioinformatics/btr124

  56. [56]

    Laurent Excoffier, Nina Marchi, David Alexander Marque s, Remi Matthey-Doret, Alexandre Gouy, and Vitor C. Sousa. Fastsimcoal2: demographic inference under complex evolutionary scenarios. Bioinformatics, 37(24): 4882–4885, June 2021. ISSN 1367-4811. doi: 10.1093/bioinf ormatics/btab468

    work page doi:10.1093/bioinf 2021

  57. [57]

    Y . S. Song, Y . Wu, and D. Gusfield. Efficient computation o f close lower and upper bounds on the minimum number of recombinations in biological sequence evolution . Bioinformatics, 21(Suppl 1):i413–i422, June 2005. ISSN 1460-2059. doi: 10.1093/bioinformatics/bti1033

    work page doi:10.1093/bioinformatics/bti1033 2005

  58. [58]

    Lyngsø, Y un S

    Rune B. Lyngsø, Y un S. Song, and Jotun Hein. Minimum reco mbination histories by branch and bound. In Algorithms in Bioinformatics , pages 239–250. Springer Berlin Heidelberg, 2005. ISBN 978 3540318125. doi: 10.1007/11557067_20

    work page doi:10.1007/11557067_20 2005

  59. [59]

    Myers and Robert C

    Simon R. Myers and Robert C. Griffiths. Bounds on the mini mum number of recombination events in a sample history. Genetics, 163(1):375–394, January 2003. ISSN 1943-2631. doi: 10.10 93/genetics/163.1.375

    work page 2003

  60. [60]

    Song and Jotun Hein

    Y un S. Song and Jotun Hein. Parsimonious reconstruction of sequence evolution and hap lotype blocks: find- ing the minimum number of recombination events , pages 287–302. Springer Berlin Heidelberg, 2003. ISBN 9783540397632. doi: 10.1007/978-3-540-39763-2_22

    work page doi:10.1007/978-3-540-39763-2_22 2003

  61. [61]

    Browning, Ying Zhou, and Sharon R

    Brian L. Browning, Ying Zhou, and Sharon R. Browning. A o ne-penny imputed genome from next-generation reference panels. The American Journal of Human Genetics , 103(3):338–348, September 2018. ISSN 0002-

    work page 2018

  62. [62]

    doi: 10.1016/j.ajhg.2018.07.015

    work page doi:10.1016/j.ajhg.2018.07.015 2018

  63. [63]

    Browning, Xiaowen Tian, Ying Zhou, and Sharon R

    Brian L. Browning, Xiaowen Tian, Ying Zhou, and Sharon R . Browning. Fast two-stage phasing of large-scale sequence data. The American Journal of Human Genetics , 108(10):1880–1890, October 2021. ISSN 0002-9297. doi: 10.1016/j.ajhg.2021.08.005

    work page doi:10.1016/j.ajhg.2021.08.005 2021

  64. [64]

    Lyngsø, Paul A

    Anastasia Ignatieva, Rune B. Lyngsø, Paul A. Jenkins, a nd Jotun Hein. Kwarg: parsimonious reconstruction of ancestral recombination graphs with recurrent mutation. Bioinformatics, 37(19):3277–3284, May 2021. ISSN 1367-4811. doi: 10.1093/bioinformatics/btab351. 31 ARG Samplers Review A P REPRINT

    work page doi:10.1093/bioinformatics/btab351 2021

  65. [65]

    A formal basis for the heuristic determination of minimum cost paths

    Peter Hart, Nils Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics , 4(2):100–107, 1968. ISSN 0536-1567. doi: 10.1109/tssc.1968.300136

    work page doi:10.1109/tssc.1968.300136 1968

  66. [66]

    On going recombination in sars-cov-2 revealed through genealogical reconstruction

    Anastasia Ignatieva, Jotun Hein, and Paul A Jenkins. On going recombination in sars-cov-2 revealed through genealogical reconstruction. Molecular Biology and Evolution , 39(2), February 2022. ISSN 1537-1719. doi: 10.1093/molbev/msac028

    work page doi:10.1093/molbev/msac028 2022

  67. [67]

    Minichiello and Richard Durbin

    Mark J. Minichiello and Richard Durbin. Mapping trait l oci by use of inferred ancestral recombination graphs. The American Journal of Human Genetics , 79(5):910–922, November 2006. ISSN 0002-9297. doi: 10.10 86/ 508901

    work page 2006

  68. [68]

    Building ancestral recombination graphs for whole genomes

    Thao Thi Phuong Nguyen, Vinh Sy Le, Hai Bich Ho, and Quang Si Le. Building ancestral recombination graphs for whole genomes. IEEE/ACM Transactions on Computational Biology and Bioinf ormatics, 14(2):478–483, March 2017. ISSN 2374-0043. doi: 10.1109/tcbb.2016.25428 01

    work page doi:10.1109/tcbb.2016.25428 2017

  69. [69]

    A hybrid approach t o optimize the number of recombinations in ancestral recombination graphs

    Nguyen Thi Phuong Thao and Le Sy Vinh. A hybrid approach t o optimize the number of recombinations in ancestral recombination graphs. In Proceedings of the 2019 9th International Conference on Bio science, Bio- chemistry and Bioinformatics, ICBBB ’19, pages 36–42. ACM, January 2019. doi: 10.1145/33 14367.3314385

    work page doi:10.1145/33 2019

  70. [70]

    Statistical prope rties of the number of recombination events in the history of a sample of DNA sequences

    Richard R Hudson and Norman L Kaplan. Statistical prope rties of the number of recombination events in the history of a sample of DNA sequences. Genetics, 111(1):147–164, September 1985. ISSN 1943-2631. doi: 10.1093/genetics/111.1.147

    work page doi:10.1093/genetics/111.1.147 1985

  71. [71]

    Building minimum r ecombination ancestral recombination graphs for whole genomes

    Nguyen Thi Phuong Thao and Le Sy Vinh. Building minimum r ecombination ancestral recombination graphs for whole genomes. In 2017 4th NAFOSTED Conference on Information and Computer Science, pages 248–253. IEEE, November 2017. doi: 10.1109/nafosted.2017.8108072

    work page doi:10.1109/nafosted.2017.8108072 2017

  72. [72]

    Chen, Paul Marjoram, and Jeffrey D

    Gary K. Chen, Paul Marjoram, and Jeffrey D. Wall. Fast an d flexible simulation of DNA sequence data. Genome Research, 19(1):136–142, November 2008. ISSN 1088-9051. doi: http: //www.genome.org/cgi/doi/10.1101/gr. 083634.108

    work page doi:10.1101/gr 2008

  73. [73]

    Song and Jotun Hein

    Y un S. Song and Jotun Hein. Constructing minimal ancest ral recombination graphs. Journal of Computational Biology, 12(2):147–169, March 2005. ISSN 1557-8666. doi: 10.1089/ cmb.2005.12.147

    work page 2005

  74. [74]

    New methods for inference of local tree topol ogies with recombinant snp sequences in populations

    Y ufeng Wu. New methods for inference of local tree topol ogies with recombinant snp sequences in populations. IEEE/ACM Transactions on Computational Biology and Bioinf ormatics, 8(1):182–193, January 2011. ISSN 1545-5963. doi: 10.1109/tcbb.2009.27

    work page doi:10.1109/tcbb.2009.27 2011

  75. [75]

    A heuristic method to reconstruct the histo ry of sequences subject to recombination

    Jotun Hein. A heuristic method to reconstruct the histo ry of sequences subject to recombination. Journal of Molecular Evolution, 36(4), April 1993. ISSN 1432-1432. doi: 10.1007/bf001821 87

    work page doi:10.1007/bf001821 1993

  76. [76]

    Rent+: an improved method f or inferring local genealogical trees from hap- lotypes with recombination

    Sajad Mirzaei and Y ufeng Wu. Rent+: an improved method f or inferring local genealogical trees from hap- lotypes with recombination. Bioinformatics, 33(7):1021–1030, December 2016. ISSN 1367-4811. doi: 10.1093/bioinformatics/btw735

    work page doi:10.1093/bioinformatics/btw735 2016

  77. [77]

    Heine, A

    K. Heine, A. Beskos, A. Jasra, D. Balding, and M. De Iorio . Bridging trees for posterior inference on ancestral recombination graphs. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , 474(2220):20180568, December 2018. ISSN 1471-2946. doi: 1 0.1098/rspa.2018.0568

    work page arXiv 2018

  78. [78]

    Hubisz, Amy L

    Melissa J. Hubisz, Amy L. Williams, and Adam Siepel. Map ping gene flow between ancient hominins through demography-aware inference of the ancestral recombinatio n graph. PLOS Genetics , 16(8):e1008895, August

    work page

  79. [79]

    doi: 10.1371/journal.pgen.1008895

    ISSN 1553-7404. doi: 10.1371/journal.pgen.1008895

    work page doi:10.1371/journal.pgen.1008895

  80. [80]

    Zhang, Arjun Biddanda, Arni Freyr Gunnarsson, Fergus Cooper, and Pier Francesco Palamara

    Brian C. Zhang, Arjun Biddanda, Arni Freyr Gunnarsson, Fergus Cooper, and Pier Francesco Palamara. Biobank- scale inference of ancestral recombination graphs enables genealogical analysis of complex traits. Nature Ge- netics, 55(5):768–776, May 2023. ISSN 1546-1718. doi: 10.1038/s4 1588-023-01379-x

    work page doi:10.1038/s4 2023

Showing first 80 references.