Abstract
The Double Cut and Join (DCJ) model is a simple and powerful model for the analysis of large structural rearrangements. After being extended to the DCJ-indel model, capable of handling gains and losses of genetic material, research has shifted in recent years toward enabling it to handle natural genomes, for which no assumption about the distribution of markers has to be made.
Whole Genome Duplications (WGD) are events that double the content and structure of a genome. In some organisms, multiple WGD events have been observed while loss of genetic material is a typical occurrence following a WGD event. Natural genomes are therefore the ideal framework, under which to study this event.
The traditional theoretical framework for studying WGD events is the Genome Halving Problem (GHP). While the GHP is solved for the DCJ model for genomes without losses, there are currently no exact algorithms utilizing the DCJ-indel model.
In this work, we make the first step towards halving natural genomes and present a simple and general view on the DCJ-indel model that we apply to derive an exact polynomial time and space solution for the GHP on genomes with at most two genes per family.
Supplementary material including a generalization to natural genomes can be found at https://doi.org/10.6084/m9.figshare.22269697.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Avdeyev, P., Alekseyev, M.A.: Linearization of ancestral genomes with duplicated genes. In: Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics. BCB ’20, Association for Computing Machinery, New York, NY, USA (2020). https://doi.org/10.1145/3388440.3412484
Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) Algorithms in Bioinformatics, pp. 163–173. Springer, Berlin Heidelberg, Berlin, Heidelberg (2006)
Bohnenkämper, L.: The floor is lava - halving genomes - supplementary material (Mar 2023). https://doi.org/10.6084/m9.figshare.22269697, https://figshare.com/articles/journal_contribution/supplement-14-03_pdf/22269697/1
Bohnenkämper, L., Braga, M.D.V., Doerr, D., Stoye, J.: Computing the rearrangement distance of natural genomes. J. Comput. Biol. 28(4), 410–431 (2021). https://doi.org/10.1089/cmb.2020.0434, pMID: 33393848
Braga, M.D.V., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol 18(9), 1167–1184 (2011). https://doi.org/10.1089/cmb.2011.0118 pMID: 21899423
Caprara, A.: Sorting by reversals is difficult. In: Proceedings of The First Annual International Conference On Computational Molecular Biology, pp. 75–83 (1997)
Compeau, P.E.: DCJ-indel sorting revisited. Algorithms for molecular biology : AMB 8(1), 6–6 (Mar 2013). https://doi.org/10.1186/1748-7188-8-6, https://pubmed.ncbi.nlm.nih.gov/23452758, 23452758[pmid]
Dehal, P., Boore, J.L.: Two rounds of whole genome duplication in the ancestral vertebrate. PLoS biology 3(10), e314–e314 (Oct 2005). https://doi.org/10.1371/journal.pbio.0030314, https://pubmed.ncbi.nlm.nih.gov/16128622, 16128622[pmid]
Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press, Computational Molecular Biology (2009)
Mixtacki, J.: Genome halving under DCJ revisited. In: Hu, X., Wang, J. (eds.) Computing and Combinatorics, pp. 276–286. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008)
Savard, O.T., Gagnon, Y., Bertrand, D., El-Mabrouk, N.: Genome halving and double distance with losses. J. Comput. Biol. 18(9), 1185–1199 (2011). https://doi.org/10.1089/cmb.2011.0136pMID: 21899424
Scannell, D.R., Byrne, K.P., Gordon, J.L., Wong, S., Wolfe, K.H.: Multiple rounds of speciation associated with reciprocal gene loss in polyploid yeasts. Nature 440(7082), 341–345 (Mar 2006). https://doi.org/10.1038/nature04562
Shao, M., Lin, Y., Moret, B.M.: An exact algorithm to compute the double-cut-and-join distance for genomes with duplicate genes. J. Comput. Biol. 22(5), 425–435 (2015). https://doi.org/10.1089/cmb.2014.0096 pMID: 25517208
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340–3346 (06 2005). https://doi.org/10.1093/bioinformatics/bti535
Acknowledgements
I thank my Master Thesis supervisors, Jens Stoye and Marília D. V. Braga for their helpful comments in discussions regarding notation, terms and the overall structure of the paper. Thanks also to Tizian Schulz for giving the paper a read and to Diego Rubert for pointing me to the book by Fertin et al. I furthermore thank the anonymous reviewers for their comments, which helped me a lot to increase the readability of the text. Lastly, I thank Daniel Doerr for making me switch from water to lava and for suggesting the catchy first part of this work’s title.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bohnenkämper, L. (2023). The Floor Is Lava - Halving Genomes with Viaducts, Piers and Pontoons. In: Jahn, K., Vinař, T. (eds) Comparative Genomics. RECOMB-CG 2023. Lecture Notes in Computer Science(), vol 13883. Springer, Cham. https://doi.org/10.1007/978-3-031-36911-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-36911-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-36910-0
Online ISBN: 978-3-031-36911-7
eBook Packages: Computer ScienceComputer Science (R0)