Issue No. 04 - October-December (2005 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2005.48
<p><b>Abstract</b>—The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics. Existing methods that assign orthologs based on the similarity between DNA or protein sequences may make erroneous assignments when sequence similarity does not clearly delineate the evolutionary relationship among genes of the same families. In this paper, we present a new approach to ortholog assignment that takes into account both sequence similarity and evolutionary events at a genome level, where orthologous genes are assumed to correspond to each other in the most parsimonious evolving scenario under genome rearrangement. First, the problem is formulated as that of computing the <it>signed reversal distance with duplicates</it> between the two genomes of interest. Then, the problem is decomposed into two new optimization problems, called <it>minimum common partition</it> and <it>maximum cycle decomposition</it>, for which efficient heuristic algorithms are given. Following this approach, we have implemented a high-throughput system for assigning orthologs on a genome scale, called SOAR, and tested it on both simulated data and real genome sequence data. Compared to a recent ortholog assignment method based entirely on homology search (called INPARANOID), SOAR shows a marginally better performance in terms of sensitivity on the real data set because it is able to identify several correct orthologous pairs that are missed by INPARANOID. The simulation results demonstrate that SOAR, in general, performs better than the iterated exemplar algorithm in terms of computing the reversal distance and assigning correct orthologs.</p>
Ortholog, paralog, gene duplication, genome rearrangement, reversal, comparative genomics.
Z. Fu et al., "Assignment of Orthologous Genes via Genome Rearrangement," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 2, no. , pp. 302-315, 2005.