Inferring Positional Homologs with Common Intervals of Sequences

Inferring orthologous and paralogous genes is an important problem in whole genomes comparisons, both for functional or evolutionary studies. In this paper, we introduce a new approach for inferring candidate pairs of orthologous genes between genomes, also called positional homologs, based on the conservation of the genomic context. We consider genomes represented by their gene order ? i.e. sequences of signed integers ? and common intervals of these sequences as the anchors of the final gene matching. We show that the natural combinatorial problem of computing a maximal cover of the two genomes using the minimum number of common intervals is NP-complete and we give a simple heuristic for this problem. We illustrate the effectiveness of this first approach using common intervals of sequences on two datasets, respectively 8 -proteobacterial genomes and the human and mouse whole genomes.

• Type: Conference
• Year: 2006
• Where: RECOMB
• Authors: Guillaume Blin, Annie Chateau, Cedric Chauve, Yannick Gingras
• Keywords: Common Intervals, Computational Biology, Final Gene Matching, Natural Combinatorial Problem, RECOMB 2006