Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
| Hi-index | 0.00 |
Functionally related genes co-evolve, probably due to selection pressures during evolution, This phenomenon leads to conservation of gene clusters across genomes, es- pecially in microbial genomes. In this paper, we propose novel iterative constraint relaxation algorithms which make use of genome contexts to effectively remove noise and ex- tract gene clusters: PairEGGS that generates gene clus- ters in a pair of genomes and MultiEGGS that combines gene clusters from genome pairs. Experiments showed that PairEGGS produced significantly larger gene clusters than existing algorithms, say FISH, and MultiEGGS was able to find gene clusters as large as of 118 genes that are common to three genomes. Both PairEGGS and MultiEGGS run fast enough to provide service on the web. URL: Genomes can be compared online at http://platcom.org/EGGS