Dokument: Constructing founder sets under allelic and non-allelic homologous recombination
| Titel: | Constructing founder sets under allelic and non-allelic homologous recombination | |||||||
| URL für Lesezeichen: | https://docserv.uni-duesseldorf.de/servlets/DocumentServlet?id=67516 | |||||||
| URN (NBN): | urn:nbn:de:hbz:061-20241114-124801-9 | |||||||
| Kollektion: | Publikationen | |||||||
| Sprache: | Englisch | |||||||
| Dokumententyp: | Wissenschaftliche Texte » Artikel, Aufsatz | |||||||
| Medientyp: | Text | |||||||
| Autoren: | Bonnet, Konstantinn [Autor] Marschall, Tobias [Autor] Doerr, Daniel [Autor] | |||||||
| Dateien: |
| |||||||
| Stichwörter: | Founder set reconstruction, Pangenomics, Homologous recombination, Variation graph, NAHR | |||||||
| Beschreibung: | Homologous recombination between the maternal and paternal copies of a chromosome is a key mechanism for human inheritance and shapes population genetic properties of our species. However, a similar mechanism can also act between different copies of the same sequence, then called non-allelic homologous recombination (NAHR). This process can result in genomic rearrangements—including deletion, duplication, and inversion—and is underlying many genomic disorders. Despite its importance for genome evolution and disease, there is a lack of computational models to study genomic loci prone to NAHR. In this work, we propose such a computational model, providing a unified framework for both (allelic) homologous recombination and NAHR. Our model represents a set of genomes as a graph, where haplotypes correspond to walks through this graph. We formulate two founder set problems under our recombination model, provide flow-based algorithms for their solution, describe exact methods to characterize the number of recombinations, and demonstrate scalability to problem instances arising in practice. | |||||||
| Rechtliche Vermerke: | Originalveröffentlichung:
Bonnet, K., Marschall, T., & Dörr, D. (2023). Constructing founder sets under allelic and non-allelic homologous recombination. Algorithms for molecular biology, 18, Article 15. https://doi.org/10.1186/s13015-023-00241 | |||||||
| Lizenz: |  Dieses Werk ist lizenziert unter einer Creative Commons Namensnennung 4.0 International Lizenz | |||||||
| Fachbereich / Einrichtung: | Mathematisch- Naturwissenschaftliche Fakultät Medizinische Fakultät | |||||||
| Dokument erstellt am: | 14.11.2024 | |||||||
| Dateien geändert am: | 14.11.2024 |
