Skip to main content

A Maximum Parsimony Principle for Multichromosomal Complex Genome Rearrangements

Author(s): Simonaitis, Pijus; Raphael, Benjamin J

To refer to this page use:
Abstract: Motivation. Complex genome rearrangements, such as chromothripsis and chromoplexy, are common in cancer and have also been reported in individuals with various developmental and neurological disorders. These mutations are proposed to involve simultaneous breakage of the genome at many loci and rejoining of these breaks that produce highly rearranged genomes. Since genome sequencing measures only the novel adjacencies present at the time of sequencing, determining whether a collection of novel adjacencies resulted from a complex rearrangement is a complicated and ill-posed problem. Current heuristics for this problem often result in the inference of complex rearrangements that affect many chromosomes. Results. We introduce a model for complex rearrangements that builds upon the methods developed for analyzing simple genome rearrangements such as inversions and translocations. While nearly all of these existing methods use a maximum parsimony assumption of minimizing the number of rearrangements, we propose an alternative maximum parsimony principle based on minimizing the number of chromosomes involved in a rearrangement scenario. We show that our model leads to inference of more plausible sequences of rearrangements that better explain a complex congenital rearrangement in a human genome and chromothripsis events in 22 cancer genomes.
Publication Date: 2022
Citation: Simonaitis, Pijus and Raphael, Benjamin J. "A Maximum Parsimony Principle for Multichromosomal Complex Genome Rearrangements." 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022) 242 (2022): 21:1-21:22. 10.4230/LIPIcs.WABI.2022.21
DOI: 10.4230/LIPIcs.WABI.2022.21
ISSN: 1868-8969
Pages: 21:1 - 21:22
Type of Material: Conference Article
Series/Report no.: Leibniz International Proceedings in Informatics (LIPIcs);
Journal/Proceeding Title: 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)
Version: Final published version. This is an open access article.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.