Daniel Doerr1, Annelyse Thévenin, Jens Stoye. 1. Faculty of Technology, Center for Biotechnology, Bielefeld University, Germany. ddoerr@cebitec.uni-bielefeld.de
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.
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: Joanna C Chiu; Ernest K Lee; Mary G Egan; Indra Neil Sarkar; Gloria M Coruzzi; Rob DeSalle Journal: Bioinformatics Date: 2006-01-12 Impact factor: 6.937
Authors: Sean Powell; Damian Szklarczyk; Kalliopi Trachana; Alexander Roth; Michael Kuhn; Jean Muller; Roland Arnold; Thomas Rattei; Ivica Letunic; Tobias Doerks; Lars J Jensen; Christian von Mering; Peer Bork Journal: Nucleic Acids Res Date: 2011-11-16 Impact factor: 16.971
Authors: Roman L Tatusov; Natalie D Fedorova; John D Jackson; Aviva R Jacobs; Boris Kiryutin; Eugene V Koonin; Dmitri M Krylov; Raja Mazumder; Sergei L Mekhedov; Anastasia N Nikolskaya; B Sridhar Rao; Sergei Smirnov; Alexander V Sverdlov; Sona Vasudevan; Yuri I Wolf; Jodie J Yin; Darren A Natale Journal: BMC Bioinformatics Date: 2003-09-11 Impact factor: 3.169
Authors: Marcus Lechner; Maribel Hernandez-Rosales; Daniel Doerr; Nicolas Wieseke; Annelyse Thévenin; Jens Stoye; Roland K Hartmann; Sonja J Prohaska; Peter F Stadler Journal: PLoS One Date: 2014-08-19 Impact factor: 3.240
Authors: Diego P Rubert; Edna A Hoshino; Marília D V Braga; Jens Stoye; Fábio V Martinez Journal: BMC Bioinformatics Date: 2018-05-08 Impact factor: 3.169