Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems

Genome rearrangements are events where large blocks of DNA exchange pieces during evolution. The analysis of such events is a tool for understanding evolutionary genomics, in whose context many rearrangement distances have been proposed, based on finding the minimum number of rearrangements to transform one genome into another, using some predefined operation. However, when more than two genomes are considered, we have new challenging problems. Studying such problems from a combinatorial point of view has been shown to be a useful tool to approach such problems, for example, the reconstruction of phylogenetic trees. We focus on genome rearrangement problems related to