A Framework for Orthology Assignment from Gene Rearrangement Data

Abstract. Gene rearrangements have been used successfully in phylogenetic reconstruction and comparative genomics, but usually under the assumption that all genomes have the same gene content and that no gene is duplicated. While these assumptions allow one to work with organellar genomes, they are too restrictive for nuclear genomes. The main challenge in handling more realistic data is how to deal with gene families, specifically, how to identify orthologs. While searching for orthologies is a common task in computational biology, it is usually done using sequence data. Sankoff first addressed the problem in 1999, introducing the notion of exemplar, but his approach uses an NP-hard optimization step to discard all but one member (the exemplar) of each gene family, losing much valuable information in the process. We approach the problem using all available data in the gene orders and gene families, provide an optimization framework in which to phrase the problem, and present some prel...

• Type: Conference
• Year: 2005
• Where: RECOMB
• Authors: Krister M. Swenson, Nicholas D. Pattengale, Bernard M. E. Moret
• Keywords: Computational Biology, Gene Families, NP-hard Optimization Step, RECOMB 2005, Valuable Information