title: Gene family assignment-free comparative genomics.
abstract: BACKGROUND
  The comparison of relative gene orders between two genomes offers deep insights into functional correlations of genes and the evolutionary relationships between the corresponding organisms. Methods for gene order analyses often require prior knowledge of homologies between all genes of the genomic dataset. Since such information is hard to obtain, it is common to predict homologous groups based on sequence similarity. These hypothetical groups of homologous genes are called gene families.
  
  
  RESULTS
  This manuscript promotes a new branch of gene order studies in which prior assignment of gene families is not required. As a case study, we present a new similarity measure between pairs of genomes that is related to the breakpoint distance. We propose an exact and a heuristic algorithm for its computation. We evaluate our methods on a dataset comprising 12 γ-proteobacteria from the literature.
  
  
  CONCLUSIONS
  In evaluating our algorithms, we show that the exact algorithm is suitable for computations on small genomes. Moreover, the results of our heuristic are close to those of the exact algorithm. In general, we demonstrate that gene order studies can be improved by direct, gene family assignment-free comparisons.
authors.affiliation: Faculty of Technology, Center for Biotechnology, Bielefeld University, Germany. ddoerr@cebitec.uni-bielefeld.de
authors.forename: Daniel
authors.initials: D
authors.lastname: Doerr
authors.forename: Annelyse
authors.initials: A
authors.lastname: Thévenin
authors.forename: Jens
authors.initials: J
authors.lastname: Stoye
mesh_terms: D000465:Algorithms; D020563:Gammaproteobacteria / Q000235:genetics; D023061:Gene Order; D016680:Genome, Bacterial / Q000235:genetics*; D023281:Genomics / Q000379:methods*; D005810:Multigene Family; D017422:Sequence Analysis, DNA / Q000379:methods*