Recombinations, chains and caps: resolving problems with the DCJ-indel model
Bohnenkämper L (2024)
Algorithms for Molecular Biology 19(1): 8.
Zeitschriftenaufsatz
| Veröffentlicht | Englisch
Download
![Open access file OA](https://pub.uni-bielefeld.de/images/access_open.png)
Autor*in
Abstract / Bemerkung
One of the most fundamental problems in genome rearrangement studiesis the (genomic) distance problem. It is typically formulated as finding the minimum number of rearrangements under a model that are needed to transform one genome into the other. A powerful multi-chromosomal model is the Double Cut and Join (DCJ) model.While the DCJ model is not able to deal with some situations that occur in practice, like duplicated or lost regions, it was extended over time to handle these cases. First, it was extended to the DCJ-indel model, solving the issue of lost markers. Later ILP-solutions for so called natural genomes, in which each genomic region may occur an arbitrary number of times, were developed, enabling in theory to solve the distance problem for any pair of genomes. However, some theoretical and practical issues remained unsolved.On the theoretical side of things, there exist two disparate views of the DCJ-indel model, motivated in the same way, but with different conceptualizations that could not be reconciled so far.On the practical side, while ILP solutions for natural genomes typically perform well on telomere to telomere resolved genomes, they have been shown in recent years to quickly loose performance on genomes with a large number of contigs or linear chromosomes. This has been linked to a particular technique, namely capping. Simply put, capping circularizes linear chromosomes by concatenating them during solving time, increasing the solution space of the ILP superexponentially. Recently, we introduced a new conceptualization of the DCJ-indel model within the context of another rearrangement problem. In this manuscript, we will apply this new conceptualization to the distance problem. In doing this, we uncover the relation between the disparate conceptualizations of the DCJ-indel model.We are also able to derive an ILP solution to the distance problem that does not rely on capping. This solution significantly improves upon the performance of previous solutions on genomes with high numbers of contigs while still solving the problem exactly and being competitive in performance otherwise. We demonstrate the performance advantage on simulated genomes as well as showing its practical usefulness in an analysis of 11 Drosophila genomes. © 2024. The Author(s).
Stichworte
Comparative genomics;
Genome rearrangement;
Double-cut-and-join;
Indels;
Integer linear programming;
Capping
Erscheinungsjahr
2024
Zeitschriftentitel
Algorithms for Molecular Biology
Band
19
Ausgabe
1
Art.-Nr.
8
Urheberrecht / Lizenzen
eISSN
1748-7188
Finanzierungs-Informationen
Open-Access-Publikationskosten wurden durch die Universität Bielefeld im Rahmen des DEAL-Vertrags gefördert.
Page URI
https://pub.uni-bielefeld.de/record/2987682
Zitieren
Bohnenkämper L. Recombinations, chains and caps: resolving problems with the DCJ-indel model. Algorithms for Molecular Biology . 2024;19(1): 8.
Bohnenkämper, L. (2024). Recombinations, chains and caps: resolving problems with the DCJ-indel model. Algorithms for Molecular Biology , 19(1), 8. https://doi.org/10.1186/s13015-024-00253-7
Bohnenkämper, Leonard. 2024. “Recombinations, chains and caps: resolving problems with the DCJ-indel model”. Algorithms for Molecular Biology 19 (1): 8.
Bohnenkämper, L. (2024). Recombinations, chains and caps: resolving problems with the DCJ-indel model. Algorithms for Molecular Biology 19:8.
Bohnenkämper, L., 2024. Recombinations, chains and caps: resolving problems with the DCJ-indel model. Algorithms for Molecular Biology , 19(1): 8.
L. Bohnenkämper, “Recombinations, chains and caps: resolving problems with the DCJ-indel model”, Algorithms for Molecular Biology , vol. 19, 2024, : 8.
Bohnenkämper, L.: Recombinations, chains and caps: resolving problems with the DCJ-indel model. Algorithms for Molecular Biology . 19, : 8 (2024).
Bohnenkämper, Leonard. “Recombinations, chains and caps: resolving problems with the DCJ-indel model”. Algorithms for Molecular Biology 19.1 (2024): 8.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Creative Commons Namensnennung 4.0 International Public License (CC-BY 4.0):
Volltext(e)
Name
s13015-024-00253-7.pdf
2.80 MB
Access Level
![Open access file OA](https://pub.uni-bielefeld.de/images/access_open.png)
Zuletzt Hochgeladen
2024-06-14T13:03:25Z
MD5 Prüfsumme
6fe54256bb7f91e1a56b3b94359de07c
Daten bereitgestellt von European Bioinformatics Institute (EBI)
Zitationen in Europe PMC
Daten bereitgestellt von Europe PubMed Central.
References
Daten bereitgestellt von Europe PubMed Central.
Export
Markieren/ Markierung löschen
Markierte Publikationen
Web of Science
Dieser Datensatz im Web of Science®Quellen
PMID: 38414060
PubMed | Europe PMC
Suchen in