Some Algorithmic Challenges in Genome-Wide Ortholog Assignment

Genome-scale assignment of orthologous genes is a fundamental and challenging problem in computational biology and has a wide range of applications in comparative genomics, functional genomics, and systems biology. Many methods based on sequence similarity, phylogenetic analysis, chromosomal syntenic information, and genome rearrangement have been proposed in recent years for ortholog assignment. Although these methods produce results that largely agree with each other, their results may still contain significant differences. In this article, we consider the recently proposed parsimony approach for assigning orthologs between closely related genomes based on genome rearrangement, which essentially attempts to transform one genome into another by the smallest number of genome rearrangement events including reversal, translocation, fusion, and fission, as well as gene duplication events. We will highlight some of the challenging algorithmic problems that arise in the approach including （i） minimum common substring partition, （ii） signed reversal distance with duplicates, and （iii） signed transposition distance with duplicates. The most recent progress towards the solution of these problems will be reviewed and some open questions will he posed. We will also discuss some possible extensions of the approach to the simultaneous comparison of multiple genomes.