title: Efficient computation of approximate gene clusters based on reference occurrences.
abstract: Whole genome comparison based on the analysis of gene cluster conservation has become a popular approach in comparative genomics. While gene order and gene content as a whole randomize over time, it is observed that certain groups of genes which are often functionally related remain co-located across species. However, the conservation is usually not perfect which turns the identification of these structures, often referred to as approximate gene clusters, into a challenging task. In this article, we present an efficient set distance based approach that computes approximate gene clusters by means of reference occurrences. We show that it yields highly comparable results to the corresponding non-reference based approach, while its polynomial runtime allows for approximate gene cluster detection in parameter ranges that used to be feasible only with simpler, e.g., max-gap based, gene cluster models. To illustrate further the performance and predictive power of our algorithm, we compare it to a state-of-the art approach for max-gap gene cluster computation.
authors: AG Genominformatik, Technische Fakultät, Universität Bielefeld, Bielefeld, Germany. kjahn@cebitec.uni-bielefeld.de
authors: Katharina
authors: K
authors: Jahn
mesh_terms: D000465:Algorithms; D002874:Chromosome Mapping; D003198:Computer Simulation; D019143:Evolution, Molecular; D023061:Gene Order; D005798:Genes, Bacterial; D016678:Genome; D006090:Gram-Negative Bacteria / Q000235:genetics; D008957:Models, Genetic; D005810:Multigene Family; D009154:Mutation