An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes

Computing the edit distance between two genomes is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. The edit distance under the DCJ model can be computed in linear time for genomes without duplicate genes, while the problem becomes NP-hard in the presence of duplicate genes. In this paper, we propose an ILP (integer linear programming) formulation to compute the DCJ distance between two genomes with duplicate genes. We also provide an efficient preprocessing approach to simplify the ILP formulation while preserving optimality. Comparison on simulated genomes demonstrates that our method outperforms MSOAR in computing the edit distance, especially when the genomes contain long duplicated segments. We also apply our method to assign orthologous gene pairs among human, mouse and rat genomes, where once again our method outperforms MSOAR.

Sharan, R.
Published in:
Research In Computational Molecular Biology, RECOMB 2014, 280-292
Presented at:
18th Annual International Conference on Research in Computational Molecular Biology (RECOMB)
Springer Verlag
978-3-319-05269-4; 978-3-319-05268-7

 Record created 2014-12-30, last modified 2018-01-28

Rate this document:

Rate this document:
(Not yet reviewed)