An algorithmic view of gene teams
Theoretical Computer Science
The incompatible desiderata of gene cluster properties
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Finding Nested Common Intervals Efficiently
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
| Hi-index | 0.00 |
The identification of conserved gene clusters is an important step towards understanding genome evolution and predicting the function of genes. Gene team is a model for conserved gene clusters that takes into account the position of genes on a genome. Existing algorithms for finding gene teams require the user to specify the maximum distance between adjacent genes in a team. However, determining suitable values for this parameter, 驴, is non-trivial. Instead of trying to determine a single best value, we propose constructing the gene team tree (GTT), which is a compact representation of all gene teams for every possible value of 驴. Our algorithm for computing the GTT extends existing gene team mining algorithms without increasing their time complexity. We compute the GTT for E. coliK-12 and B. subtilisand show that E. coliK-12 operons are recovered at different values of 驴. We also describe how to compute the GTT for multi-chromosomal genomes and illustrate using the GTT for the human and mouse genomes.