Quantifying the Rearrangement Complexity of Pangenomes
Abstract
The study of evolution between species (phylogenetics) and the study of evolution within a species (population genetics) are highly related, as the same biological mechanisms are fundamental to both fields. Although both have been studied for a long time, their joint study in a unified setting has been prevented by the different time scales they consider and the different data types they employ. A similar discrepancy holds for their whole-genome specializations, comparative genomics and pangenomics. Two active areas in these fields are genome rearrangement studies and graphical pangenomics, respectively. Since the emergence of graphical pangenomics, these have existed as separate fields, despite observations that central data structures representing genomic variants in both fields are highly similar. While there exists a wealth of theoretical results for various rearrangement models in comparative genomics, the application to pangenomic data is hampered by the limitations of rearrangement problem formulations. On the practical side, pangenomes typically contain too many individual genomes for classical problems, such as the often NP-hard parsimony problems, to be solved, or for all-vs-all comparisons using rearrangement distances to be performed. On the theoretical side, some assumptions in the formulation of rearrangement problems, such as the assumption of an underlying tree, are inadequate for many pangenomes. In this work, we propose the Complete Ancestral Reconstruction for Pangenomes (CARP) problem, which overcomes these limitations while retaining intuitive relationships to both classical rearrangement problems and pangenome graphs.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- FWCI
- 0.00
- Field percentile
- 22th percentile
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Simulating population pangenomes under coalescent demographic models with MSpangenome
Lucien Piat, Sukanya Denni, … Ludovic Duvaux·bioRxiv·Jul 3, 2026
- Building pangenome graphs
Erik P. Garrison, Andrea Guarracino, … Pjotr Prins·Nature MethodsPeer-reviewed·Oct 21, 2024
- Homology-based perspective on pangenome graphs
Anna Lisiecka, Agnieszka Kowalewska, Norbert Dojer·bioRxiv·Mar 18, 2026
- Towards a Unified Exact Solution of Rearrangement Small Parsimony for Natural Genomes
Leonard Bohnenkämper, Daria Frolova·bioRxiv·Jun 28, 2026
- The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization is NP-Hard
M. LeMay, Y.-C. Wu, R. Libeskind-Hadas·bioRxiv·Mar 14, 2021
- RecGraph: adding recombinations to sequence-to-graph alignments
Jorge Avila Cartes, Paola Bonizzoni, … Francesco Porto·bioRxiv·Oct 27, 2022