Comparative genomics meets topology: a novel view on genome median and halving problems

作者：Alexeev Nikita^*; Avdeyev Pavel; Alekseyev Max A

来源：BMC Bioinformatics, 2016, 17(S14): 3.

DOI：10.1186/s12859-016-1263-7

• Median problem
• Halving problem
• Breakpoint graphs
• Embedded graphs

Background: Genome median and genome halving are combinatorial optimization problems that aim at reconstruction of ancestral genomes by minimizing the number of evolutionary events between them and genomes of the extant species. While these problems have been widely studied in past decades, their solutions are often either not efficient or not biologically adequate. These shortcomings have been recently addressed by restricting the problems solution space.
Results: We show that the restricted variants of genome median and halving problems are, in fact, closely related. We demonstrate that these problems have a neat topological interpretation in terms of embedded graphs and polygon gluings. We illustrate how such interpretation can lead to solutions to these problems in particular cases.
Conclusions: This study provides an unexpected link between comparative genomics and topology, and demonstrates advantages of solving genome median and halving problems within the topological framework.

• 出版日期2016-11-11