Published in

Springer, Lecture Notes in Computer Science, p. 331-345, 2008

DOI: 10.1007/978-3-540-78839-3_28

Mary Ann Liebert, Journal of Computational Biology, 8(16), p. 1085-1099

DOI: 10.1089/cmb.2009.0098

Links

Tools

Export citation

Search in Google Scholar

Computation of Median Gene Clusters

Journal article published in 2008 by Sebastian Böcker ORCID, Katharina Jahn, Julia Mixtacki, Jens Stoye
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e., sets of genes that occur co-localized in several genomes. For most applications, it is preferable to extend this definition to allow for small deviations in the gene content of the cluster occurrences. However, relaxing the equality constraint increases the computational complexity of gene cluster detection drastically. Existing approaches deal with this problem by using simplifying constraints on the cluster definition and/or allowing only pairwise genome comparison. In this article, we introduce a cluster concept named median gene clusters that improves over existing models, present efficient algorithms for their computation and show experimental results on the detection of approximate gene clusters in multiple genomes.